Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Integrating Equational Reasoning into Instantiation-Based Theorem Proving

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3210))

Included in the following conference series:

Abstract

In this paper we present a method for integrating equational reasoning into instantiation-based theorem proving. The method employs a satisfiability solver for ground equational clauses together with an instance generation process based on an ordered paramodulation type calculus for literals. The completeness of the procedure is proved using the the model generation technique, which allows us to justify redundancy elimination based on appropriate orderings.

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. Bachmair, L., Ganzinger, H.: Equational reasoning in saturation-based theorem proving. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction — A Basis for Applications, ch. 11, vol. I, pp. 353–397. Kluwer, Dordrecht (1998)

    Google Scholar 

  2. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp. 19–100. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  3. 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 

  4. 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 

  5. 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)

    Chapter  Google Scholar 

  6. Caferra, R., Zabel, N.: A method for simultaneous search for refutations and models by equational constraint solving. J. of Symbolic Computation 13(6), 613–641 (1992)

    Article  MathSciNet  Google Scholar 

  7. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): fast decision procedures. In: 16th Int. Conf. on Computer Aided Verification. LNCS (2004, To appear)

    Google Scholar 

  8. Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proc. 18th IEEE Symposium on Logic in Computer Science, pp. 55–64. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue Francaise d’Intelligence Artificielle 4(3), 9–52 (1990), Special issue on automated deduction

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 142–156. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. 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 

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

    Chapter  Google Scholar 

  15. Plaisted, D., Zhu, Y.: Ordered semantic hyper-linking. J. of Automated Reasoning 25(3), 167–217 (2000)

    Article  MathSciNet  Google Scholar 

  16. Stenz, G.: The Disconnection Calculus. In: Logos, Dissertation, TU München (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MPI für Informatik, Saarbrücken, Germany

    Harald Ganzinger & Konstantin Korovin

Authors
  1. Harald Ganzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantin Korovin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University, Poland

    Jerzy Marcinkowski

  2. Polish Academy of Sciences, Institute of Computer Science, Poland

    Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganzinger, H., Korovin, K. (2004). Integrating Equational Reasoning into Instantiation-Based Theorem Proving. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30124-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30124-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation