Skip to main content
SpringerLink
Log in

A two steps semantics for logic programs with negation

  • Session 11: Semantics II
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

We analyze programs with negation by transforming them in order to infer constrained atoms which are regarded as basic semantic objects. Two steps are performed. Step I refers to the positive fragment of the program and unfolds all positive literals so that only atoms and conditional atoms remain. Step II refers to the stratified fragment and replaces defined negative literals with inequalities and equalities.

Part of this work was supported by the ESPRIT Basic Research Actions “Integration”.

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

Access this chapter

Log in via an institution

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. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.

    Google Scholar 

  2. K. R. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann, Los Altos, Ca., 1988.

    Google Scholar 

  3. R. Barbuti and M. Martelli. Recognizing Non-Floundering Logic Programs and Goals. International Journal on Foundations of Computer Science, 1(2):151–163, 1990.

    Article  Google Scholar 

  4. A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. Contributions to the Semantics of Open Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, 1992. To appear.

    Google Scholar 

  5. A. Bossi and M. Menegus. Una Semantica Composizionale per Programmi Logici Aperti. In P. Asirelli, editor, Proc. Sixth Italian Conference on Logic Programming, pages 95–109, 1991.

    Google Scholar 

  6. F. Bry. Logic Programming as Constructivism: A Formalization and its Application to Databases. In Proc. Eighth ACM Symp. on Principles of Database Systems, 1989.

    Google Scholar 

  7. F. Bry. Negation in Logic Programming: A Formalization in Constructive Logic. In Proc. First Workshop on Information Systems and Artificial Intelligence, Ulm, West Germany, 1990.

    Google Scholar 

  8. 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, Cambridge, Mass., 1988.

    Google Scholar 

  9. Phan Minh Dung and K. Kanchanasut. A Fixpoint Approach to Declarative Semantics of Logic Programs. In E. Lusk and R. Overbeck, editors, Proc. North American Conf. on Logic Programming'89, pages 604–625. The MIT Press, Cambridge, Mass., 1989.

    Google Scholar 

  10. Phan Minh Dung and K. Kanchanasut. A Natural Semantics of Logic Programs with Negation. In Proc. of the Ninth Int'l Conf. on Foundations of Software Technology and Theoretical Computer Science, volume 405 of Lecture Notes in Computer Science, pages 70–80. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  11. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289–318, 1989.

    Article  Google Scholar 

  12. M. Gabbrielli and G. Levi. Modeling Answer Constraints in Constraint Logic Programs. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 238–252. The MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  13. M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1–19. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  14. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111–119. ACM, 1987.

    Google Scholar 

  15. K. Kanchanasut and P. Stuckey. Eliminating Negation from Normal Logic Programs. In H. Kirchner and W. Wechler, editors, Proc. Second Int'l Conf. on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 217–231. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  16. G. Levi. Models, Unfolding Rules and Fixpoint Semantics. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 1649–1665. The MIT Press, Cambridge, Mass., 1988.

    Google Scholar 

  17. G. Levi and P. Mancarella. The Unfolding Semantics of Logic Programs. Technical Report TR-13/88, Dipartimento di Informatica, Università di Pisa, 1988.

    Google Scholar 

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

    Google Scholar 

  19. J. W. Lloyd and R. W. Topor. A Basis for Deductive Database Systems II. Journal of Logic Programming, 3(1):55–67, 1986.

    Article  Google Scholar 

  20. K. Marriott, H. Søndergaard, and P. Dart. A Characterization of Non-Floundering Logic Programs. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 661–680. The MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  21. T. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, Los Altos, Ca., 1988.

    Google Scholar 

  22. J. C. Shepherdson. Negation as Failure II. Journal of Logic Programming, 2(3):185–202, 1985.

    Article  Google Scholar 

  23. P. J. Stuckey. Constructive Negation for Constraint Logic Programming. In Proc. Sixth IEEE Symp. on Logic In Computer Science. IEEE Computer Society Press, 1991.

    Google Scholar 

  24. D. Turi. Extending S-Models to Logic Programs with Negation. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 397–411. The MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Maurizio Gabbrielli & Giorgio Levi

  2. Centrum voor Wiskunde en Informatica, P.O. Box 4079, 1009, AB Amterdam, The Netherlands

    Daniele Turi

Authors
  1. Maurizio Gabbrielli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Levi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniele Turi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gabbrielli, M., Levi, G., Turi, D. (1992). A two steps semantics for logic programs with negation. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013070

Download citation

  • DOI: https://doi.org/10.1007/BFb0013070

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation