Skip to main content
Log in

Resolution on formula-trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We introduce a nonclausal resolution calculus on formula-trees which comprises classical resolution as a special case. The resolvents produced in this calculus are more structure preserving than in nonclausal resolution by Murray and Manna and Waldinger and simpler than in nested resolution by Traugott. Proofs of correctness and completeness are given. In some examples, first experiences made when implementing the calculus are discussed.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bibel, W.: Automated Theorem Proving. Braunschweig: Vieweg 1982

    MATH  Google Scholar 

  2. Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press 1973

    MATH  Google Scholar 

  3. Delsarte, P., Snyers, D., Thayse, A.: Preuves de théorèmes basées sur les propositions de la logique de Boole, Proc. 5ème Congrès Reconnaissance de formes et intelligence artificielle, pp. 869–879. Paris: AFCET 1985

    Google Scholar 

  4. Gallier, J.: Logic for Computer Science, New York: Harper & Row 1986

    MATH  Google Scholar 

  5. Gentzen, G.: Untersuchungen über das logische Schlie\en. Math. Z.39, 176–210, 405–431 (1934)

    Article  MATH  MathSciNet  Google Scholar 

  6. Manna, Z., Waldinger, R.: Special relations in automated deduction. J. ACM 33 (1986)

  7. Maslov, S.Ju. : An inverse method of establishing deducibility in classical predicate calculus, pp. 17–20. Dokl. Akad. Nauk. SSR, 1964

  8. Miller, D., Felty, A.: An integration of resolution and natural deduction theorem proving, pp. 198–202. c. 5th Natl. Conf. on Artif. Intell.AAAI, Berkeley 1986

    Google Scholar 

  9. Murray, N.V.: Completely non-clausal theorem proving, Artificial Intelligence18, 67–85 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nilsson, N.J.: Principles of Artificial Intelligence. Palo Alto Tioga Publ. 1980

  11. Pelletier, F.J.: Seventy-five problems for testing automatic theorem provers. J. Automated Reasoning2, 191–216 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  12. Prawitz, D.: An improved proof procedure. Theoria26, 102–139 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  13. Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM12, 23–41 (1965)

    Article  MATH  Google Scholar 

  14. Robinson J.A.: Automated deduction with hyper-resolution. Int. J. Assoc. Comput. Mach.12, 33–41 (1965)

    Google Scholar 

  15. Schütte, K.: Beweistheorie. Berlin: Springer 1960

    MATH  Google Scholar 

  16. Takeuti, G.: Proof Theory. Amsterdam: North Holland 1975

    Google Scholar 

  17. Traugott, J.: Nested Resolution, c. 8th Conf. on Autom. Deduct., Lect. Notes Comput. Sci. Vol. 230. Berlin, Heidelberg, New York: Springer 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmerl, U.R. Resolution on formula-trees. Acta Informatica 25, 425–438 (1988). https://doi.org/10.1007/BF02737109

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation