Constructive Negation by Pruning and Optimizing Higher-Order Predicates for CLP and CC Languages

We survey several forms of negation in constraint logic programming following the program's completion approach. We show that a new scheme called constructive negation by pruning provides a generic operational semantics which is correct and complete w.r.t. Kunen's threevalued logic semantics. We emphasis a full abstraction result which permits to go beyond the theorem proving point of view and to completely characterize the operational behavior of CLP programs with negation. We derive from these results a complete scheme for optimization higher-order predicates in CLP languages, and an operational semantics for concurrent constraint (CC) languages extended with negation and optimization higher-order agents.

[1]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[2]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[3]  François Fages.  On the Semantics of Optimization Predicates in CLP Languages , 1993, FSTTCS.

[4]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[5]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[6]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[7]  Annalisa Bossi,et al.  A Bottom-up Semantics for Constructive Negation , 1994, International Conference on Logic Programming.

[8]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[9]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[10]  Maurizio Gabbrielli,et al.  The s-Semantics Approach: Theory and Applications , 1994, J. Log. Program..

[11]  Peter J. Stuckey,et al.  Constructive negation for constraint logic programming , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[12]  Pascal Van Hentenryck,et al.  Constraint Satisfaction Using Constraint Logic Programming , 1992, Artif. Intell..

[13]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[14]  Maurizio Gabbrielli,et al.  Declarative Interpretations Reconsidered , 1994, ICLP.

[15]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[16]  Michael J. Maher.  Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[17]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

[18]  Michael J. Maher.  A Logic Programming View of CLP , 1993, ICLP.

[19]  Maurizio Gabbrielli,et al.  Modeling Answer Constraints in Constraint Logic Programs , 1991, ICLP.

[20]  François Fages,et al.  Handling Preferences in Constraint Logic Programming with Relational Optimization , 1994, PLILP.

[21]  Michael J. Maher,et al.  Expanding Query Power in Constraint Logic Programming Languages , 1989, NACLP.