Skip to main content
Springer Nature Link
Log in

Generalised Handling of Variables in Disconnection Tableaux

  • Conference paper
Automated Reasoning (IJCAR 2004)

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

Included in the following conference series:

  • 425 Accesses

Abstract

Recent years have seen a renewed interest in instantiation based theorem proving for first-order logic. The disconnection calculus is a successful approach of this kind, it integrates clause linking into a tableau guided proof procedure. In this paper we consider extensions of both the linking concept and the treatment of variables which are based on generalised notions of unifiability. These extensions result in significantly enhanced search space pruning and may permit the reduction of the length of refutations below Herbrand complexity which normally is a lower bound to the proof lengths of instantiation based methods. We present concise proofs of soundness and completeness of the new methods and show how these concepts relate to other instantiation based approaches.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baumgartner, P.: FDPLL – A First-Order Davis-Putnam-Logeman-Loveland Procedure. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 200–219. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Baumgartner, P., Tinelli, C.: The Model Evolution Calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Beckert, B., Hähnle, R.: Analytic tableaux. In: Automated Deduction — A Basis for Applications, Foundations, vol. I, pp. 11–41. Kluwer, Dordrecht (1998)

    Google Scholar 

  4. Billon, J.-P.: The disconnection method: a confluent integration of unification in the analytic framework. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 110–126. Springer, Heidelberg (1996)

    Google Scholar 

  5. Fitting, M.C.: First-Order Logic and Automated Theorem Proving. Springer, Heidelberg (1996) (second revised edn.)

    MATH  Google Scholar 

  6. Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proceedings of the eightteenth Annual IEEE Syposium on Logic in Computer Science (LICS 2003) 9, June 22- 25, pp. 55–64. IEEE Computer Society, Los Alamitos (2003)

    Chapter  Google Scholar 

  7. Hooker, J., Rago, G., Chandru, V., Shrivastava, A.: Partial instantiation methods for inference in first-order logic. Journal of Automated Reasoning 28(5), 371–396 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee, S.-J., Plaisted, D.: Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 25–42 (1992)

    Google Scholar 

  9. Letz, R.: Clausal tableaux. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction — A Basis for Applications, Foundations, vol. I, pp. 43–72. Kluwer, Dordrecht (1998)

    Google Scholar 

  10. Letz, R., Mayr, K., Goller, C.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning 13(3), 297–337 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Letz, R., Stenz, G.: Proof and Model Generation with Disconnection Tableaux. In: Voronkov, A. (ed.) Proceedings, 8th LPAR, Havanna, Cuba, December 2001, pp. 142–156. Springer, Berlin (2001)

    Google Scholar 

  12. Letz, R.: First-order calculi and proof procedures for automated deduction. PhD thesis, TH Darmstadt (June 1993)

    Google Scholar 

  13. Letz, R.: On the polynomial transparency of resolution. In: Bajcsy, R. (ed.) Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI), Chambery, France, pp. 123–129. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  14. Letz, R., Mayr, K., Goller, C.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning 13(3), 297–338 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  15. Letz, R., Stenz, G.: Integration of Equality Reasoning into the Disconnection Calculus. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 176–190. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Letz, R., Stenz, G.: Universal Variables in Disconnection Tableaux. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 117–133. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Plaisted, D.A., Zhu, Y.: Ordered semantic hyper linking. Journal of Automated Reasoning 25(3), 167–217 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Smullyan, R.: First-Order Logic. Springer, Heidelberg (1968)

    MATH  Google Scholar 

  19. Stenz, G.: DCTP 1.2 – System Abstract. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, p. 335. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Stenz, G.: The Disconnection Calculus. Dissertation, Fakultät für Informatik, Technische Universität München. Logos Verlag, Berlin (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, D-85748, Garching, Germany

    Reinhold Letz & Gernot Stenz

Authors
  1. Reinhold Letz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gernot Stenz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland

    David Basin

  2. LORIA & INRIA Lorraine UMR 7503,  

    Michaël Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Letz, R., Stenz, G. (2004). Generalised Handling of Variables in Disconnection Tableaux. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25984-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22345-0

  • Online ISBN: 978-3-540-25984-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation