Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1988: Foundations of Software Technology and Theoretical Computer Science pp 400–418Cite as

A resolution rule for well-formed formulae

  • Session 11 Logic Prog. And Theorem Proving
  • Conference paper
  • First Online:

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

Abstract

A resolution proof procedure that operates on well-formed formulae with all quantifiers in place is presented. Extension of the unification algorithm to Q-unification (i.e. with quantifiers in place) is also discussed. The procedure involves a single inference rule called WFF-resolution which is proved to be sound and complete.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhatta, K.S.H.S.R. Many-Sorted Resolution for Well-Formed Formulae with Equality, M. Tech. Dissertation, I.I.T. Kanpur, 1988.

    Google Scholar 

  2. Chang, C.L., and Lee, R.C. Symbolic Logic and Mechanical Theorem Proving, Academic Press, Orlando, Fla., 1973.

    Google Scholar 

  3. Manna, Z., and Waldinger, R. Special Relations in Program-Synthetic Deduction, Tech. Report, Comp. Sci. Dept., Stanford Univ., Stanford, California, and Artificial Intelligence Center, SRI International, Menlo Park, California, March 1982.

    Google Scholar 

  4. Murray, N.V. "Completely Non-Clausal Theorem Proving", A1 18(1), 1982, pp.67–85.

    Google Scholar 

  5. Pelletier, F.J. "Seventy-Five Problems for testing Automatic Theorem Provers", J. of Automated Reasoning 2, 1986, pp. 191–216.

    Google Scholar 

  6. Quine, W.V. Methods of Logic, Holt, Rinehart and Winston Inc., New York, 1961.

    Google Scholar 

  7. Robinson, J.A. "A Machine-oriented Logic Based on Resolution Principle", JACM 12(1), 1965, pp.23–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology, 208 016, Kanpur, U.P., India

    K. S. H. S. R. Bhatta & Harish Karnick

Authors
  1. K. S. H. S. R. Bhatta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harish Karnick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori Sanjeev Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhatta, K.S.H.S.R., Karnick, H. (1988). A resolution rule for well-formed formulae. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-50517-2_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50517-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation