Necessary condition for Constructive Negation in Constraint Logic Programming

Information Processing Letters

Volumn 74, Issue 3, 2000, Pages 147-156

  Dovier, Agostino ^a   Pontelli, Enrico ^b   Rossi, Gianfranco ^c  

^a UNIVERSITY OF VERONA   (Italy)

^b New Mexico State University   (United States)

^c UNIVERSITY OF PARMA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; LOGIC PROGRAMMING;

CONSTRAINT LOGIC PROGRAMMING; CONSTRUCTIVE NEGOTIATION;

THEOREM PROVING;

EID: 0033750239     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00046-6     Document Type: Article

References (16)

1. Apt K.R., Bol R. Logic programming and negation: A survey. J. Logic Programming. Vol. 19-20:1994;9-71.
2. Barbuti R., Mancarella P., Pedreschi D., Turini F. A transformation approach to negation in logic programming. J. Logic Programming. Vol. 8:1990;201-228.
3. Chan D. Constructive Negation based on the completed database. Logic Programming, Proc. 5th International Conference and Symposium. 1988;111-125 MIT Press, Cambridge, MA.
4. Dovier A., Omodeo E.G., Pontelli E., Rossi G. {log}: A language for programming in logic with finite sets. J. Logic Programming. Vol. 28:(1):1996;1-44.
5. Dovier A., Policriti A., Rossi G. A uniform axiomatic view of lists, multisets and sets, and the relevant unification algorithms. Fund. Inform. Vol. 36:(2/3):1998;201-234.
6. Drabent W. What is failure? An approach to constructive negation. Acta Inform. Vol. 32:(1):1995;27-29.
7. Enderton H.B. A Mathematical Introduction to Logic. 2nd printing:1973;Academic Press, New York.
8. Fages F. Constructive Negation by pruning. J. Logic Programming. Vol. 32:(2):1997;85-118.
9. Jaffar J., Maher M.J. Constraint logic programming: A survey. J. Logic Programming. Vol. 19-20:1994;503-581.
10. Jaffar J., Maher M.J., Marriott K., Stuckey P.J. The semantics of constraint logic programs. J. Logic Programming. Vol. 37:1998;1-46.
11. Lloyd J.W., Topor R.W. Making Prolog more expressive. J. Logic Programming. Vol. 1:(3):1984;225-240.
12. Maher M.J. Complete axiomatizations of the algebras of finite, rational and infinite trees. Proc. 3rd Symposium Logic in Computer Science, Edinburgh. 1988;349-357.
13. Przymusinski T.C. On constructive negation in logic programming. Lusk E.L., Overbeek R.A. Logic Programming, Proceedings of the North American Conference 1989. 1989;MIT Press, Cambridge, MA.
14. Shepherdson J.C. Negation in logic programming. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;19-88 Morgan Kaufmann, Los Altos, CA.
15. Stuckey P.J. Negation and constraint logic programming. Inform. and Comput. Vol. 1:1995;12-33.
16. Vaught R.L. On a theorem of Cobham concerning undecidable theories. Proc. 1960 International Congress. 1962;14-25 Stanford University Press, Stanford, CA.