2008
DOI: 10.1007/s10485-008-9128-5
|View full text |Cite
|
Sign up to set email alerts
|

A Functorial Framework for Constraint Normal Logic Programming

Abstract: The semantic constructions and results for definite programs do not extend when dealing with negation. The main problem is related to a well-known problem in the area of algebraic specification: if we fix a constraint domain as a given model, its free extension by means of a set of Horn clauses defining a set of new predicates is semicomputable. However, if the language of the extension is richer than Horn clauses its free extension (if it exists) is not necessarily semicomputable. In this paper we present a f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…In addition to the classical formulation in (Jaffar and Lassez 1987;Jaffar et al 1998), other formalizations have been used for different purposes. Some significative examples are: the CLP scheme proposed in (Höhfeld and Smolka 1988), motivated by applications to computational linguistics and allowing more than one constraint structure to come along with a given constraint language; the proof-theoretical notion of constraint system given in (Saraswat 1992), intended for application to concurrent constraint languages; and the constraint systems proposed in (Lucio et al 2008) as the basis of a functorial semantics for CLP with negation, where a single constraint structure is replaced by a class of elementary equivalent structures.…”
Section: Constraint Domainsmentioning
confidence: 99%
“…In addition to the classical formulation in (Jaffar and Lassez 1987;Jaffar et al 1998), other formalizations have been used for different purposes. Some significative examples are: the CLP scheme proposed in (Höhfeld and Smolka 1988), motivated by applications to computational linguistics and allowing more than one constraint structure to come along with a given constraint language; the proof-theoretical notion of constraint system given in (Saraswat 1992), intended for application to concurrent constraint languages; and the constraint systems proposed in (Lucio et al 2008) as the basis of a functorial semantics for CLP with negation, where a single constraint structure is replaced by a class of elementary equivalent structures.…”
Section: Constraint Domainsmentioning
confidence: 99%