Constructive negation by pruning

Journal of Logic Programming

Volumn 32, Issue 2, 1997, Pages 85-118

  Fages, François ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CONSTRAINT THEORY; EFFICIENCY; OPTIMIZATION;

CONSTRAINT PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0031209371     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00092-1     Document Type: Article

References (30)

1. Apt, K. and Bol, R., Logic Programming and Negation: A Survey, J. Logic Programming 19/20:9-71 (1994).
2. Apt, K., Blair, H. A., and Walker, A., Towards a Theory of Declarative Knowledge, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1987, pp. 89-148.
3. Bossi, A., Fabris, M., and Meo, M. C., A Bottom-Up Semantics for Constructive Negation, in: Proc. 11th Int. Conf. Logic Programming, MIT Press, 1994, pp. 520-534.
4. Bossi, A., Gabbrielli, M., Levi, G., and Martelli, M., The s-Semantics Approach: Theory and Applications, J. Logic Programming 19/20:149-197 (1994).
5. Bruscoli, P., Levi, F., Levi, G., and Meo, M. C., Compilative Constructive Negation in Constraint Logic Programs, in: S. Tsion (ed.), Proc. CAAP'94, LNCS 787, Springer-Verlag, 1994, pp. 52-67.
6. Chan, D., Constructive Negation Based on the Completed Database, in: R. A. Kowalski and K. A. Bowen (eds.), Proc. 5th Int. Conf. Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 11-125.
7. Chan, D., An Extension of Constructive Negation and Its Applications in Coroutining, in: Proc. North American Conf. Logic Programming'89, Cleveland, OH, MIT Press, 1989, pp. 477-493.
8. Drabent, W., What Is Failure? An Approach to Constructive Negation, Acta Informatica 32:27-59 (1995).
9. Fages, F., On the Semantics of Optimization Predicates in CLP Languages, in: Proc. 13th FSTTCS Conf., Bombay, LNCS 761, Springer-Verlag, 1993, pp. 193-204.
10. Fages, F., Constructive Negation by Pruning and Optimization Higher-Order Predicates for CLP and CC Languages, in: A. Podelski (ed.), Constraint Programming: Basics and Trends, LNCS 910, Springer-Verlag, 1995, pp. 68-89.
11. Fages, F., Fowler, J., and Sola, T., Handling Preferences in Constraint Logic Programming with Relational Optimization, in: Proc. PLILP'94, Madrid, LNCS 844, Springer-Verlag, 1994, pp. 261-276.
12. Fitting, M., A Kripke/Kleene Semantics for Logic Programs, J. Logic Programming 2:295-312 (1985).
13. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., Declarative Modeling of the Operational Behavior of Logic Programs, Theoretical Comput. Sci. 69:289-318 (1989).
14. Girodias, P., Cerny, E., and Older, W. J., Solving Linear, Min and Max Constraint Systems Using CLP Based on Relational Interval Arithmetic, in: Proc. 1st Int. Conf. Constraint Programming CP'95, Cassis, France, LNCS 976, Springer-Verlag, 1995, pp. 186-203.
15. Jaffar, J. and Lassez, J. L., Constraint Logic Programming, in: Proc. POPL'87, Munich, 1987, pp. 111-119.
16. Jaffar, J. and Maher, M. J., Constraint Logic Programming: A Survey, J. Logic Programming 19/20:503-581 (1994).
17. Kunen, K., Negation in Logic Programming, J. Logic Programming 4:289-308 (1987).
18. Kunen, K., Signed Data Dependencies in Logic Programming, J. Logic Programming 7:231-245 (1989).
19. Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1987.
20. Maher, M. J., Logic Semantics for a Class of Committed-Choice Languages, in: Proc. 4th Int. Conf. Logic Programming, MIT Press, 1987, pp. 858-876.
21. Maher, M. J., A Logic Programming View of CLP, in: Proc. 10th Int. Conf. Logic Programming, MIT Press, 1993, pp. 737-753.
22. Maluszyński, J. and Näslund, T., Fail Substitutions for Negation as Failure, in: Proc. North American Conf. Logic Programming'89, Cleveland, OH, MIT Press, 1989, pp. 461-476.
23. Maher, M. J. and Stuckey, P. J., Expanding Query Power in Constraint Logic Programming Languages, in: Proc. North American Conf. Logic Programming'89, Cleveland, OH, MIT Press, 1989, pp. 20-36.
24. Marriott, K. and Stuckey, P. J., Semantics of Constraint Logic Programs with Optimization, ACM Lett. Programming Languages and Syst. 2:197-212 (1993).
25. Saraswat, V., Concurrent Constraint Programming, MIT Press, 1993.
26. Stuckey, P., Constructive Negation for Constraint Logic Programming, in: Proc. LICS'91, 1991, pp. 328-339.
27. Stuckey, P., Negation and Constraint Logic Programming, Inform. and Computation 118:12-33 (1995).
28. Van Hentenryck, P., Constraint Satisfaction in Logic Programming, MIT Press, 1989.
29. Van Hentenryck, P., Deville, Y., and Teng, C. M., A Generic Arc-Consistency Algorithm and Its Specialization, Artificial Intell. 57:291-321 (1992).
30. Fages, F. and Goli, R., A Hierarchy of Semantics for Normal Constraint Logic Programs, in: Proc. Fifth Int. Conf. on Algebraic and Logic Programming'96, Aachen, LNCS, Springer-Verlag, 1996.