Skip to main content
SpringerLink
Log in

Connection Tableau Calculi with Disjunctive Constraints

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Automated theorem proving amounts to solving search problems in usually tremendous search spaces. A lot of research therefore focuses on search space reductions. Our approach reduces the search space which arises when using so-called connection tableau calculi for first-order automated theorem proving. It uses disjunctive constraints over first-order equations to compress certain parts of this search space. We present the basics of our constrained-connection-tableau calculi, a constraint extension of connection tableau calculi, and deal with the efficient handling of constraints during the search process. The new techniques are integrated into the automated connection tableau prover Setheo.

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

Access this article

Log in via an institution

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. Baar, T., B. Fischer, and D. Fuchs, 'Integrating deduction techniques in a software reuse application', Journal of Universal Computer Science 5(3):52-72, 1999.

    Google Scholar 

  2. Bibel, W., Deduction: Automated Logic, Academic Press, London, 1993.

    Google Scholar 

  3. Bibel, W., S. BrÜning, J. Otten, T. Rath, and T. Schaub, 'Compressions and extensions', in W. Bibel and P. H. Schmitt (eds.), Automated Deduction — A Basis for Applications, volume 8 of Applied Logic Series, chapter 5, pages 133-179, Kluwer Academic Publishers, 1998.

  4. Brand, D., 'Proving theorems with the modification method', SIAM Journal of Computing 4(4):412-430, 1975.

    Google Scholar 

  5. Fischer, B., J. Schumann, and G. Snelting, 'Deduction-based software component retrieval', in W. Bibel and P. H. Schmitt (eds.), Automated Deduction — A Basis for Applications, volume 10 of Applied Logic Series, chapter 11, pages 265-292, Kluwer Academic Publishers, 1998.

  6. Fitting, M., First-Order Logic and Automated Theorem Proving, Springer, 1996.

  7. Gallier, J., and W. Snyder, 'Complete sets of transformations for general e-unification', Theoretical Computer Science 67:203-260, 1989.

    Google Scholar 

  8. Graf, P., and D. Fehrer, 'Term indexing', in W. Bibel and P. H. Schmitt (eds.), Automated Deduction — A Basis for Applications, volume 9 of Applied Logic Series, chapter 5, pages 125-147, Kluwer Academic Publishers, 1998.

  9. Ibens, O., 'Automated theorem proving with disjunctive constraints', in J. Jaffar (ed.), Principles and Practice of Constraint Programming — CP'99, volume 1713 of Lecture Notes in Computer Science, pages 484-485, Springer, October 1999.

  10. Ibens, O., Connection Tableau Calculi with Disjunctive Constraints, PhD thesis, Institut für Informatik, TU München, 1999.

    Google Scholar 

  11. Ibens, O., 'Search space compression in connection tableau calculi using disjunctive constraints', in Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000), Lecture Notes in Artificial Intelligence, Springer, 2000.

  12. Ibens, O., and R. Letz, 'Subgoal alternation in model elimination', in TABLEAUX'97, volume 1227 of Lecture Notes in Artificial Intelligence, pages 201-215, Springer, 1997.

  13. Letz, R., First-Order Calculi and Proof Procedures for Automated Deduction, PhD thesis, Technische Hochschule Darmstadt, 1993.

  14. Letz, R., K. Mayr, and C. Goller, 'Controlled integration of the cut rule into connection tableau calculi', Journal of Automated Reasoning 13:297-337, 1994.

    Google Scholar 

  15. McCune, W. W., 'Solution of the Robbins problem', Journal of Automated Reasoning 3(19):263-276, 1997.

    Google Scholar 

  16. Moser, M., O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr, 'SETHEO and E-SETHEO — The CADE-13 systems', Journal of Automated Reasoning 18:237-246, 1997.

    Google Scholar 

  17. Moser, M., and J. Steinbach, 'STE-Modification revisited', Technical Report AR-97-03, Technische Universität München, Institut für Informatik, 1997.

  18. Ohlbach, H. J., 'Abstraction tree indexing for terms', in ECAI-90, Proceedings of the 9th European Conference on Artificial Intelligence, pages 479-484, Stockholm, 1990.

  19. Stickel, M. E., 'A Prolog technology theorem prover: Implementation by an extended Prolog compiler', Journal of Automated Reasoning 4:353-380, 1988.

    Google Scholar 

  20. Sutcliffe, G., C. B. Suttner, and T. Yemenis, 'The TPTP problem library', in A. Bundy (ed.), Automated Deduction — CADE-12, volume 814 of Lecture Notes in Artificial Intelligence, pages 778-782, Springer, 1994.

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik Technische, Universität München, Germany

    Ortrun Ibens

Authors
  1. Ortrun Ibens
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ibens, O. Connection Tableau Calculi with Disjunctive Constraints. Studia Logica 70, 241–270 (2002). https://doi.org/10.1023/A:1015134701251

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015134701251

Search

Navigation