Skip to main content
SpringerLink
Log in

Towards a complete proof procedure to prove properties of normal logic programs under the completion

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation (LOPSTR 1995)

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

  • 151 Accesses

Abstract

Extended execution is an extension of SLDNF resolution which was shown useful for proving properties of logic programs. It was meant for definite programs and an extension to normal ones was proposed afterwards. The correctness of the extended framework has been shown and in this paper we investigate the question of its completeness. We give results at the propositional level and discuss a possible alternative to achieve completeness at the non propositional one.

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. Apt. Introduction to Logic Programming. In J. Van Leeuven, editor, Handbook of Theoretical Computer Science. North Holland, 1990.

    Google Scholar 

  2. K. R. Apt and R. Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19,20:9–71, 1994.

    Google Scholar 

  3. A. Bottoni and G.Levi. Computing in the Completion. In Atti dell Ottavo Convegno sulla Programmazione Logica (Gulp), pages 375–389. Mediterranean Press, 1993.

    Google Scholar 

  4. P. Bruscoli, F. Levi, G. Levi, and M. C. Meo. Intensional Negation in Constraint Logic Programs. In Atti dell Ottavo Convegno sulla Programmazione Logica (Gulp), pages 359–373. Mediterranean Press, 1993.

    Google Scholar 

  5. K. L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293–322. Plenum Press, New York, 1978.

    Google Scholar 

  6. A. Cortesi and G. Filé. Graph Properties for Normal Programs. Theoretical Computer Science, 107:277–303, 1993.

    Google Scholar 

  7. W. Drabent. What is Failure? An Approach to Constructive Negation. Acta Informatica, 32:27–59, 1995.

    Google Scholar 

  8. M. Fitting. A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 2:295–312, 1985.

    Google Scholar 

  9. L. Fribourg. Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. In Proceedings of the Seventh Int. Conference on Logic Programming, Jerusalem, pages 685–699, 1990.

    Google Scholar 

  10. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620–650, 1991.

    Google Scholar 

  11. T. Kanamori. Soundness and Completeness of Extended Execution for Proving Properties of Prolog Programs. Technical Report TR-175, ICOT, 1986.

    Google Scholar 

  12. T. Kanamori, H. Fujita, K. Horiuchi, and M. Maeji. ARGUS/V: a System for Verification of Prolog Programs. Technical Report TR-176, ICOT, 1986.

    Google Scholar 

  13. T. Kanamori and H. Seki. Verification of Logic Programs Using an Extension of Execution. In Proceedings of the Third International Conference on Logic Programming, London, pages 475–489, 1986.

    Google Scholar 

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

    Google Scholar 

  15. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  16. N. V. Murray. Completely non-clausal theorem proving. Journal of Artificial Intelligence, 18:67–85, 1982.

    Google Scholar 

  17. D. Pedreschi R. Barbuti, P. Mancarella and F. Turini. A Transformational Approach to Negation in Logic Programming. Journal of Logic Programming, 8:201–228, 1990.

    Google Scholar 

  18. S. Renault. Generalizing Extended Execution for Normal Programs. In F. Turini and L. Fribourg, editors, Proceedings of the Fourth International Workshops on Logic Program Synthesis and Transformation and Meta-Programming in Logic, LNCS, pages 154–169. Springer-Verlag, 1994.

    Google Scholar 

  19. J. A. Robinson. A Machine Oriented Logic Based on the Resolution Principle. Journal of the Association for Computing Machinery, 12, 1965.

    Google Scholar 

  20. T. Sato and F. Motoyoshi. A Complete Top-down Interpreter for First Order Programs. In Proceedings of the Int. Logic Programming Symposium, San Diego, pages 35–53. MIT Press, 1991.

    Google Scholar 

  21. D. van Dalen. Logic and Structure. Springer Verlag, Berlin, second edition, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, UK

    Sophie Renault

Authors
  1. Sophie Renault
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurizio Proietti

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Renault, S. (1996). Towards a complete proof procedure to prove properties of normal logic programs under the completion. In: Proietti, M. (eds) Logic Program Synthesis and Transformation. LOPSTR 1995. Lecture Notes in Computer Science, vol 1048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60939-3_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-60939-3_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60939-1

  • Online ISBN: 978-3-540-49745-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation