Deriving Focused Calculi for Transitive Relations

  • Georg Struth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2051)

Abstract

We propose a new method for deriving focused ordered resolution calculi, exemplified by chaining calculi for transitive relations. Previously, inference rules were postulated and a posteriori verified in semantic completeness proofs. We derive them from the theory axioms. Completeness of our calculi then follows from correctness of this synthesis. Our method clearly separates deductive and procedural aspects: relating ordered chaining to Knuth-Bendix completion for transitive relations provides the semantic background that drives the synthesis towards its goal. This yields a more restrictive and transparent chaining calculus. The method also supports the development of approximate focused calculi and a modular approach to theory hierarchies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation, 4(3):217–247, 1994.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    L. Bachmair and H. Ganzinger. Rewrite techniques for transitive relations. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 384–393. IEEE Computer Society Press, 1994.Google Scholar
  3. 3.
    L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM, 45(6):1007–1049, 1998.MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    L. Bachmair and H. Ganzinger. Strict basic superposition. In 15th International Conference on Automated Deduction, volume 1421 of LNAI, pages 160–174. Springer-Verlag, 1998.Google Scholar
  5. 5.
    W. Bledsoe, K. Kunen, and R. Shostak. Completeness results for inequality provers. Artificial Intelligence, 27:255–288, 1985.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    W. W. Bledsoe and L. M. Hines. Variable elimination and chaining in a resolution-based prover for inequalities. In W. Bibel and R. Kowalski, editors, 5th Conference on Automated Deduction, volume 87 of LNCS, pages 70–87. Springer-Verlag, 1980.Google Scholar
  7. 7.
    L. M. Hines. Completeness of a prover for dense linear logics. J. Automated Reasoning, 8:45–75, 1992.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J. Levy and J. Agustí. Bi-rewrite systems. J. Symbolic Computation, 22:279–314, 1996.MATHCrossRefGoogle Scholar
  9. 9.
    U. Martin and T. Nipkow. Ordered rewriting and con uence. In M. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNCS, pages 366–380. Springer-Verlag, 1990.Google Scholar
  10. 10.
    M. M. Richter. Some reordering properties for inequality proof trees. In E. Börger, G. Hasenjaeger, and D. Rödding, editors, Logic and Machines: Decision Problems and Complexity, Proc. Symposium “Rekursive Kombinatorik”, volume 171 of LNCS, pages 183–197. Springer-Verlag, 1983.Google Scholar
  11. 11.
    J. R. Slagle. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. Journal of the ACM, 19(1):120–135, 1972.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    M. Stickel. Automated deduction by theory resolution. In A. Joshi, editor, 9th International Joint Conference on Artificial Intelligence, pages 1181–1186. Morgan Kaufmann, 1985.Google Scholar
  13. 13.
    G. Struth. Deriving focused calculi for transitive relations (extended version). http://www.informatik.uni-freiburg.de/~struth/papers/focus.ps.gz.
  14. 14.
    G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut für Informatik, Universität des Saarlandes, 1998.Google Scholar
  15. 15.
    L. Wos, G.A. Robinson, and D.F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the ACM, 12(4):536–541, 1965.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Georg Struth
    • 1
  1. 1.Institut für InformatikAlbert-Ludwigs-Universität FreiburgFreiburg i. Br.Germany

Personalised recommendations