Advertisement

Semantic tableaux with ordering restrictions

  • Stefan Klingenbeck
  • Reiner Hähnle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 814)

Abstract

The aim of this paper is to make restriction strategies based on orderings of the Herbrand universe available for semantic tableau-like calculi as well. A marriage of tableaux and ordering restriction strategies seems to be most promising in applications where generation of counter examples is required. In this paper, starting out from semantic trees, we develop a formal tool called refutation graphs, which (i) serves as a basis for completeness proofs of both resolution and tableaux, and (ii) is compatible with so-called A-ordering restrictions. The main result is a first-order ground tableau procedure complete for A-ordering restrictions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    O. Astrachan and M. Stickel. Caching and lemmaizing in model elimination theorem provers. In D. Kapur, editor, Proc. 11th Conference on Automated Deduction, Albany/NY, USA, pages 224–238. Springer LNAI 607, 1992.Google Scholar
  2. 2.
    L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-9-1-208, Max-Planck-Institut für Informatik, MPI at Saarbrücken, Germany, 1991.Google Scholar
  3. 3.
    W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, 2nd edition, 1987.Google Scholar
  4. 4.
    W. Bibel and E. Eder. Decomposition of tautologies into regular formulas and strong completeness of connection graph resolution. Technical Report AIDA-94-0?, FG Intellektik, FB Informatik, TH Darmstadt, Mar. 1994.Google Scholar
  5. 5.
    R. Caferra and N. Zabel. A tableaux method for systematic simultaneous search for refutations and models using equational problems. Journal of Logic and Computation, 3(1):3–26, 1993.Google Scholar
  6. 6.
    C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973.Google Scholar
  7. 7.
    C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer LNAI 679, 1993.Google Scholar
  8. 8.
    M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.Google Scholar
  9. 9.
    W. H. Joyner. Resolution strategies as decision procedures. Journal of the Association for Computing Machinery, 23(3):398–417, 1976.Google Scholar
  10. 10.
    T. Käufl and N. Zabel. Cooperation of decision procedures in a tableau-based theorem prover. Revue d'Intelligence Artificielle, 4(3):99–126, 1990.Google Scholar
  11. 11.
    R. Kowalski and P. Hayes. Semantic trees in automatic theorem-proving. Machine Intelligence, 4:87–101, 1969.Google Scholar
  12. 12.
    R. Letz. First-Order Calcult and Proof Procedures for Automated Deduction. PhD thesis, TH Darmstadt, June 1993.Google Scholar
  13. 13.
    R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A high-perfomance theorem prover. Technical report, Forschungsgruppe KI, TU München, 1991.Google Scholar
  14. 14.
    D. W. Loveland. Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, 1978.Google Scholar
  15. 15.
    F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69–100, 1988.Google Scholar
  16. 16.
    R. E. Shostak. Refutation graphs. Artificial Intelligence, 7:51–64, 1976.Google Scholar
  17. 17.
    J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, 14(4):687–697, 1967.Google Scholar
  18. 18.
    T. Tammet. The resolution program, able to decide some solvable classes. In Proceedings COLOG-88, Talinn, pages 300-312. Springer, LNCS 417, 1990.Google Scholar
  19. 19.
    N. Zamov. Maslov's inverse method and decidable classes. Annals of Pure and Applied Logic, 42:165–194, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Stefan Klingenbeck
    • 1
  • Reiner Hähnle
    • 1
  1. 1.Institute for Logic, Complexity and Deduction SystemsUniversity of KarlsruheKarlsruheGermany

Personalised recommendations