Skip to main content
SpringerLink
Log in

Analysis of Normal Logic Programs

  • Conference paper
  • First Online:
Static Analysis (SAS 1998)

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

Included in the following conference series:

  • 343 Accesses

Abstract

In this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.

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. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier and The MIT Press, 1990.

    Google Scholar 

  2. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19–20:149–197, 1994.

    Article  MathSciNet  Google Scholar 

  3. D. Chan. Constructive Negation Based on the Completed Database. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int’l Conf. on Logic Programming, pages 111–125. The MIT Press, 1988.

    Google Scholar 

  4. A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer System, pages 85–99, 1984.

    Google Scholar 

  5. M. Comini. Abstract Interpretation framework for Semantics and Diagnosis of Logic Programs. PhD thesis, Dipartimento di Informatica, Università di Pisa, 1998.

    Google Scholar 

  6. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238–252, 1977.

    Google Scholar 

  7. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269–282, 1979.

    Google Scholar 

  8. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103–179, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Fages. Constructive negation by pruning. Journal of Logic Programming, 32(2):85–118, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Fages and R. Gori. A hierarchy of semantics for normal constraint logic programs. In M. Hanus M. Rodriguez-Artalejo, editor, Proc. Fifth Int’l Conf. on Algebraic and Logic Programming, volume 1139 of Lecture Notes in Computer Science, pages 77–91. Springer-Verlag, 1996.

    Google Scholar 

  11. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2:295–312, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  12. R. Giacobazzi. “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics. In C. Puech and R. Reischuk, editors, Proc. 13th International Symposium on Theoretical Aspects of Computer Science (STACS’96), volume 1046 of Lecture Notes in Computer Science, pages 503–514. Springer-Verlag, 1996.

    Google Scholar 

  13. S. Koppelberg. Handbook of Boolean Algebras (Vol.I). Elsevier Science Publisher B.V.(North Holland), 1989.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. K. Kunen. Signed Data Dependencies in Logic Programs. Journal of Logic Programming, 7(3):231–245, 1989.

    Article  MathSciNet  Google Scholar 

  16. J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann, Los Altos, Ca., 1988.

    Google Scholar 

  17. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.

    Google Scholar 

  18. M.J. Maher. Complete axiomatizations of the algebra of finite, rational and infinite trees. In Third Symp. on Logic in Computer Science, pages 348–357, 1988.

    Google Scholar 

  19. K. Marriott and H. Sondergaard. Bottom-up Dataflow Analysis of Normal Logic Programs. Journal of Logic Programming, 13(2 & 3):181–204, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  20. T. Sato and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34:227–240, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  21. P. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1):12–33, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIENS CNRS, Ecole Normale Supérieure, 45 rue d’Ulm, 75005, Paris, France

    François Fages

  2. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Roberta Gori

Authors
  1. François Fages
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberta Gori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia, 40, I-56125, Pisa, Italy

    Giorgio Levi

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fages, F., Gori, R. (1998). Analysis of Normal Logic Programs. In: Levi, G. (eds) Static Analysis. SAS 1998. Lecture Notes in Computer Science, vol 1503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49727-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-49727-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49727-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation