Skip to main content
SpringerLink
Log in

Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1847))

  • 956 Accesses

Abstract

Automated theorem proving with connection tableau calculi imposes search problems in tremendous search spaces. We present a new approach to search space reduction in connection tableau calculi. In our approach structurally similar connection tableaux are compressed with the help of symbolic disjunctive constraints. We describe the necessary changes of the calculus, and we develop elaborate techniques for an efficient constraint processing. Moreover, we extend the most important search pruning techniques for connection tableau calculi to our approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bibel, W.: Deduction: Automated Logic. Academic Press, London (1993)

    Google Scholar 

  2. Bibel, W., Brüning, S., Otten, J., Rath, T., Schaub, T.: Compressions and extensions. In: Applied Logic Series 8, pp. 133–179. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  3. Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, Heidelberg (1996)

    MATH  Google Scholar 

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

    Google Scholar 

  5. Ibens, O., Letz, R.: Subgoal Alternation in Model Elimination. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 201–215. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

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

    Google Scholar 

  7. Letz, R., Mayr, K., Goller, C.: Controlled Integration of the Cut Rule into Connection Tableau Calculi. JAR 13, 297–337 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Moser, M., Ibens, O., Letz, R., Steinbach, J., Goller, C., Schumann, J., Mayr, K.: ETHEO and E-SETHEO - The CADE-13 Systems. JAR 18, 237–246 (1997)

    Article  Google Scholar 

  9. Ohlbach, H.J.: Abstraction Tree Indexing for Terms. In: Proc. ECAI 1990, pp. 479–484 (1990)

    Google Scholar 

  10. Sutcliffe, G., Suttner, C.B., Yemenis, T.: The TPTP problem library. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 778–782. Springer, Heidelberg (1994)

    Google Scholar 

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

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St Andrews, Scotland

    Roy Dyckhoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibens, O. (2000). Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_23

Download citation

  • DOI: https://doi.org/10.1007/10722086_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation