Skip to main content
SpringerLink
Log in

Connection Tableaux with Lazy Paramodulation

  • Conference paper
Automated Reasoning (IJCAR 2006)

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

Included in the following conference series:

Abstract

It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tableau calculus for logic with equality. This calculus is based on a lazy form of paramodulation where parts of the unification step become auxiliary subgoals in a tableau and may be subjected to subsequent paramodulations. Our calculus uses ordering constraints and a certain form of the basicness restriction.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Loveland, D.W.: Mechanical theorem proving by model elimination. Journal of the ACM 16(3), 349–363 (1968)

    Article  Google Scholar 

  2. Letz, R., Schumann, J., Bayerl, S., Bibel, W.: SETHEO: a high-performance theorem prover. Journal of Automated Reasoning 8(2), 183–212 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Letz, R., Stenz, G.: Model elimination and connection tableau procedures. In: Robinson, A., Voronkov, A. (eds.) Handbook for Automated Reasoning, vol. II, pp. 2017–2116. Elsevier Science, Amsterdam (2001)

    Google Scholar 

  4. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook for Automated Reasoning, vol. I, pp. 371–443. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  5. Degtyarev, A., Voronkov, A.: What you always wanted to know about rigid E-unification. Journal of Automated Reasoning 20(1), 47–80 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Giese, M.: A model generation style completeness proof for constraint tableaux with superposition. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 130–144. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Loveland, D.W.: Automated Theorem Proving: A Logical Basis. Fundamental studies in Computer Science, vol. 6. North-Holland, Amsterdam (1978)

    MATH  Google Scholar 

  8. Moser, M., Ibens, O., Letz, R., Steinbach, J., Goller, C., Schumann, J., Mayr, K.: SETHEO and E-SETHEO — the CADE-13 systems. Journal of Automated Reasoning 18(2), 237–246 (1997)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Moser, M., Steinbach, J.: STE-modification revisited. Technical Report AR-97-03, Fakultät für Informatik, Technische Universität München, München (1997)

    Google Scholar 

  11. Bachmair, L., Ganzinger, H., Voronkov, A.: Elimination of equality via transformation with ordering constraints. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, Springer, Heidelberg (1998)

    Google Scholar 

  12. Moser, M., Lynch, C., Steinbach, J.: Model elimination with basic ordered paramodulation. Technical Report AR-95-11, Fakultät für Informatik, Technische Universität München, München (1995)

    Google Scholar 

  13. Gallier, J., Snyder, W.: Complete sets of transformations for general E-unification. Theoretical Computer Science 67, 203–260 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Snyder, W., Lynch, C.: Goal directed strategies for paramodulation. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 150–161. Springer, Heidelberg (1991)

    Google Scholar 

  15. Moser, M.: Improving transformation systems for general E-unification. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 92–105. Springer, Heidelberg (1993)

    Google Scholar 

  16. Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation. Information and computation 121(2), 172–192 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Dougherty, D.J., Johann, P.: An improved general E-unification method. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 261–275. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Algorithmique, Complexité et Logique, Université Paris 12, 94010, Créteil Cedex, France

    Andrei Paskevich

Authors
  1. Andrei Paskevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Artificial Intelligence Research Group, University of Koblenz-Landau, Universitätsstr. 1, 56070, Koblenz

    Ulrich Furbach

  2. SRI International, MS EL256,, 333 Ravenswood Avenue, 94025-3493, Menlo Park, CA, USA

    Natarajan Shankar

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paskevich, A. (2006). Connection Tableaux with Lazy Paramodulation. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_10

Download citation

  • DOI: https://doi.org/10.1007/11814771_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37187-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation