Skip to main content
SpringerLink
Log in

A proof procedure for hereditary Harrop formulas with free equality

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

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

Included in the following conference series:

  • 118 Accesses

Abstract

We use a proof procedure for hereditary Harrop formulas to infer facts from programs containing Clark's Equational Theory (CET). In comparison with PROLOG, this allows to establish not only unifiability but also non-unifiability of terms. The described proof procedure is sound and complete w.r.t. minimal logic. As an interesting application, we translate program completion into hereditary Harrop formulas. SLDNF-resolution proves to be sound w.r.t. this translation. Since the described proof procedure treats negation as inconsistency, this kind of negation turns out to be a more general notion than negation as failure.

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. Logic Programming and Negation: a Survey. Technical Report CS-R9402, CWI, Netherlands, 1994.

    Google Scholar 

  2. D.M. Gabbay and M.J. Sergot. Negation as Inconsistency. I Journal of Logic Programming, 3(1):1–36, 1986.

    Google Scholar 

  3. A. Gomolko. Negation as Inconsistency in Prolog via Intuitionistic Logic. LNCS 832, 1994.

    Google Scholar 

  4. J. Harland. A Clausal Form for the Completion of Logic Programs. In Proceedings of the 8th International Conference on Logic Programming, pages 711–725, Paris, France, 1991.

    Google Scholar 

  5. K. Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7(4):231–246, 1989.

    Google Scholar 

  6. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1984.

    Google Scholar 

  7. D. Miller, G. Nadathur, F. Pfenning and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.

    Google Scholar 

  8. E. Mendelson. Introduction to Mathematical Logic. Van Nostrand, Princeton, NJ. 2nd ed., 1979.

    Google Scholar 

  9. G. Nadathur. A Proof Procedure for the Logic of Hereditary Harrop Formulas. Journal of Automated Reasoning, 11:115–145, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Logic Faculty of Mathematics and Mechanics, Moscow State University, 119899, Moscow, Russia

    Evgeny Makarov

Authors
  1. Evgeny Makarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makarov, E. (1997). A proof procedure for hereditary Harrop formulas with free equality. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation