How to incorporate negation in a prolog compiler

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1753, Issue , 2000, Pages 124-140

  Moreno Navarro, Juan José ^a   Muñoz Hernández, Susana ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Global analysis; Implementation of negation; Semantics of negation

Indexed keywords

KNOWLEDGE REPRESENTATION; SEMANTICS;

A-PROLOG; ACTIVE AREA; GLOBAL ANALYSIS; IMPLEMENTATION OF NEGATION; PROLOG COMPILER; SOURCE CODES;

PROGRAM COMPILERS;

EID: 84958961641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46584-7_9     Document Type: Conference Paper

References (26)

1. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 3, pages 493-574, Elsevier, New York, 1990.
2. R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. Intensional negation of logic programs. Lecture notes on Computer Science, 250:96-110, 1987.
3. R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. JLP, 8(3):201-228, 1990.
4. C. Braem, B. Le Charlier, S. Modart, and P. Van Hentenryck. Cardinality analysis of Prolog. In I. S. on Logic Programming, pages 457-471. The MIT Press, 1994.
5. P. Bruscoli, F. Levi, G. Levi, and M.C. Meo. Compilative Constructive Negation in Constraint Logic Programs. In Sophie Tyson, editor, Proc. of the Nineteenth International Colloquium on Trees in Algebra and Programming, CAAP’94, volume 787 of LNCS, pages 52-67, Berlin, 1994. Springer-Verlag.
6. M. Carlsson. Freeze, indexing, and other implementation issues in the wam. In I. Conference on Logic Programming, pages 40-58. The MIT Press, 1987.
7. D. Chan. Constructive negation based on the complete database. In Proc. Int. Conference on Logic Programming’88, pages 111-125. The MIT Press, 1988.
8. D. Chan. An extension of constructive negation and its application in coroutining. In Proc. NACLP’89, pages 477-493. The MIT Press, 1989.
9. K. L. Clark. Negation as failure. In J. Minker H. Gallaire, editor, Logic and Data Bases, pages 293-322, New York, NY, 1978.
10. [10] W. Drabent. What is a failure? An approach to constructive negation. Acta Informatica., 33:27-59, 1995.
11. [11] M. García de la Banda, K. Marriott, and P. Stuckey. Efficient analysis of constraint logic programs with dynamic scheduling. In 1995 International Logic Programming Symposium, pages 417-431. The MIT Press, 1995.
12. [12] A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. J. of the ACM, 38(3):620-650, 1991.
13. [13] M. Hermenegildo, F. Bueno, D. Cabeza, M. García de la Banda, P. López, and G. Puebla. The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems. In Parallelism and Implementation of Logic and Constraint Logic Programming. Nova Science, Commack, NY, USA, April 1999.
14. [14] P.M. Hill and J.W. Lloyd. The Gödel Programming Language. The MIT Press, 1994.
15. [15] K. Kunen. Negation in logic programming. J. of Logic Programming, 4:289-308, 1987.
16. [16] J. W. Lloyd. Foundations of Logic Programing, 2nd edition. Springer, 1987.
17. [17] P. López-García, M. Hermenegildo, S. Debray, and N. W. Lin. Lower bound cost estimation for logic programs. In 1997 International Logic Programming Symposium. MIT Press, 1997.
18. [18] J.J. Moreno-Navarro. Default rules: An extension of constructive negation for narrowing-based languages. In Proc. ICLP’94, pages 535-549. The MIT Press, 1994.
19. [19] S. Munoz. Algunas técnicas para el tratamiento de información negativa en Prolog. Master’s thesis, Facultad de Informática, UPM, 1997.
20. [20] K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. JLP, 13(2/3):315-347, July 1992.
21. [21] L. Naish. Negation and quantifiers in NU-Prolog. In Proc. 3rd ICLP, 1986.
22. [22] A. Di Pierro, M. Martelli, and C. Palamidessi. Negation as instantiation. Information and Computation, 120(2):263-278, 1995.
23. G. Puebla, M. García de la Banda, K. Marriott, and P. Stuckey. Optimization of Logic Programs with Dynamic Scheduling. In 1997 International Conference on Logic Programming, pages 93-107, Cambridge, MA, June 1997. MIT Press.
24. [24] R. F. Stark. Cut-property and negation as failure. International Journal of Foundations of Computer Science, 5(2):129-164, 1994.
25. [25] P. Stuckey. Constructive negation for constraint logic programming. In Proc. IEEE Symp. on Logic in Computer Science, volume 660. IEEE Comp. Soc. Press, 1991.
26. [26] A. Voronkov. Logic programming with bounded quantifiers. In A. Voronkov, editor, First Russian Conference on Logic Programming, volume 592, pages 486-514, Irkutsk, Rusia, September 1990. Springer 1992.