P. Stuckey "Negation and constraint logic programming", Information and Computation 118(1), pp.12-33 (1995).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....unit must be shown to be compositional with respect to the kind of module operations considered, but the non monotonic nature of negation in Logic Programming does not seem to fit too well with compositionality. In particular, for different reasons, none of the various operational semantics [7,11,26], neither the different model theoretic approaches (see e.g. 2] nor the completion semantics [6,17] seem to be adequate to be the basis for defining a compositional semantics for normal logic program units. To our knowledge, only [8, 14, 19] provide some compositional semantic constructs for ....

....[3] This kind of restriction is not needed in our work. We have not directly related our approach with other kinds of semantics, although the relation established with completion implies, by transitivity, that our semantics can be considered equivalent to constructive negation approaches as [7,26]. Actually, the relation to [7] is quite more direct, in the sense that the construction of our least models is closely related to ranked resolution as defined there. There is also a certain relation between the construction of our least models and Fitting s fixpoint semantics [9] or rather with ....

[Article contains additional citation context not shown here]

P. J. Stuckey, Negation and Constraint Logic Programming, in Information and Computation (1995), pp. 12-23.

.... consequences of the program s completion 3 [16] Kunen s semantics enjoys the main desirable properties, in particular it is recursively enumerable, general (i.e. defined for the whole class of normal CLP programs) compatible with negation as failure [17] and faithful to constructive negation [20]. Kunen s semantics is not defined as a fixpoint however. It can be characterized by the finite powers of Fitting s operator whose least fixpoint gives a different, highly non effective semantics [9] Second, the negation as failure rule is a sound but incomplete inference rule for normal CLP ....

....highly non effective semantics [9] Second, the negation as failure rule is a sound but incomplete inference rule for normal CLP programs. The constructive negation by pruning rule introduced by Chan [4] provides normal CLP programs with a complete operational semantics w.r.t. Kunen s semantics [20]. However that scheme has not received yet a fully abstract fixpoint semantics characterizing the computed answer constraints for instance. In [8] such a fixpoint semantics has been given for a variant of the constructive negation rule, called constructive negation by pruning. That semantics ....

[Article contains additional citation context not shown here]

P. Stuckey "Negation and constraint logic programming", Information and Computation 118(1), pp.12-33 (1995).

....related to Deductive Databases [Llo87, Ull88] We also survey the concept of the Augmented Database, as presented in [Oli91, UO92] which is needed to describe in section 3 the main features of our approach. Finally, we shortly describe the basic concepts of Constraint Logic Programming [JMSY92, JM94, Stu91, Stu95], that we also use in section 3 for the procedural definition of our method, and we state the correspondence between them and deductive databases. 2.1 Deductive Databases Throughout the paper, we consider a first order language with a universe of constants, a set of variables, a set of predicate ....

....iWks(e,d) iHsal(e) Wst(d) iWst(d) iLucky emp(e) iWks(e,d) iHsal(e) dWst(d) iIc1 iSal(e,s) s 1000 iIc2 iWks(e,d) Dpt(d) iDpt(d) iIc iIc1 iIc iIc2 2. 3 Constraint Logic Programming In the following, we shortly describe the basic concepts of Constraint Logic Programming [JM94, Stu91, Stu95] and we state the correspondence between them and deductive databases. Roughly, Constraint Logic Programming can be said to involve the incorporation of constraints and constraint solving methods in a logic based language. A Constraint Logic Programming language CLP(S) exists in the context of ....

[Article contains additional citation context not shown here]

Stuckey, P.J. "Negation and Constraint Logic Programming", Information and Computation, 118(1), 1995, pp. 12-33.

No context found.

P. Stuckey "Negation and constraint logic programming", Information and Computation 118(1), pp.12-33 (1995).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC