Skip to main content
SpringerLink
Log in

How to Incorporate Negation in a Prolog Compiler?

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1753))

Included in the following conference series:

Abstract

Knowledge representation based applications require a more complete set of capabilities than those offered by conventional Prolog compilers. Negation is, probably, the most important one. The inclusion of negation among the logical facilities of LP has been a very active area of research, and several techniques have been proposed. However, the negation capabilities accepted by current Prolog compilers are very limited. In this paper, we discuss the possibility to incorporate some of these techniques in a Prolog compiler in an efficient way. Our idea is to mix some of the existing proposals guided by the information provided by a global analysis of the source code.

This research was partly supported by the Spanish CICYT project TIC96.1012-C02-02.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. Intensional negation of logic programs. Lecture notes on Computer Science, 250:96–110, 1987.

    Google Scholar 

  3. R. Barbuti, D. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. JLP, 8(3):201–228, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  8. D. Chan. An extension of constructive negation and its application in coroutining. In Proc. NACLP’89, pages 477–493. The MIT Press, 1989.

    Google Scholar 

  9. K. L. Clark. Negation as failure. In J. Minker H. Gallaire, editor, Logic and Data Bases, pages 293–322, New York, NY, 1978.

    Google Scholar 

  10. W. Drabent. What is a failure? An approach to constructive negation. Acta Informatica., 33:27–59, 1995.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  14. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. The MIT Press, 1994.

    Google Scholar 

  15. K. Kunen. Negation in logic programming. J. of Logic Programming, 4:289–308, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  16. J. W. Lloyd. Foundations of Logic Programing, 2nd edition. Springer, 1987.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  19. S. Munoz. Algunas técnicas para el tratamiento de información negativa en Prolog. Master’s thesis, Facultad de Informática, UPM, 1997.

    Google Scholar 

  20. K. Muthukumar and M. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. JLP, 13(2/3):315–347, July 1992.

    Article  MATH  Google Scholar 

  21. L. Naish. Negation and quantifiers in NU-Prolog. In Proc. 3rd ICLP, 1986.

    Google Scholar 

  22. A. Di Pierro, M. Martelli, and C. Palamidessi. Negation as instantiation. Information and Computation, 120(2):263–278, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  24. R. F. Stark. Cut-property and negation as failure. International Journal of Foundations of Computer Science, 5(2):129–164, 1994.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. LSIIS - Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo s/n, 28660, Madrid, Spain

    Juan José Moreno-Navarro & Susana Muñoz-Hernández

Authors
  1. Juan José Moreno-Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susana Muñoz-Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science New Science Hall, New Mexico State University, Box 30001, MS CS, Stewart Street, Las Cruces, NM, 88003, USA

    Enrico Pontelli

  2. COPPE/Sistemas e Computação Centro de Tecnologia, Universidade Federal do Rio de Janeiro, Bloco H-319, Cx. Postal 68511, Rio de Janeiro, Brazil, CEP:21945-970

    Vítor Santos Costa

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

José Moreno-Navarro, J., Muñoz-Hernández, S. (1999). How to Incorporate Negation in a Prolog Compiler?. In: Pontelli, E., Santos Costa, V. (eds) Practical Aspects of Declarative Languages. PADL 2000. Lecture Notes in Computer Science, vol 1753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46584-7_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-46584-7_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66992-0

  • Online ISBN: 978-3-540-46584-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation