Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2010: Computer Science Logic pp 155–169Cite as

Embedding Deduction Modulo into a Prover

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6247))

Abstract

Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such as the polarized resolution modulo. We show how to combine this method with more traditional ordering restrictions. Interestingly, no compatibility between the rewriting and the ordering is requested to ensure completeness. We also show that some simplification rules, such as strict subsumption eliminations and demodulations, preserve completeness. For this purpose, we use a new framework based on a proof ordering. These results show that polarized resolution modulo can be integrated into existing provers, where these restrictions and simplifications are present. We also discuss how this integration can actually be done by diverting the main algorithm of state-of-the-art provers.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachmair, L.: Proof normalization for resolution and paramodulation. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 15–28. Springer, Heidelberg (1989)

    Google Scholar 

  2. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Log. Comput. 4(3), 217–247 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Burel, G., Dowek, G.: How can we prove that a proof search method is not an instance of another? In: LFMTP 2009. ACM International Conference Proceeding Series, pp. 84–87. ACM, New York (2009)

    Chapter  Google Scholar 

  4. Burel, G., Kirchner, C.: Regaining cut admissibility in deduction modulo using abstract completion. Inform. Comput. 208, 140–164 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dowek, G.: What is a theory? In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 50–64. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Dowek, G.: Truth values algebras and proof normalization. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 110–124. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Dowek, G.: Polarized resolution modulo (2010) (to be presented at IFIP TCS)

    Google Scholar 

  8. Dowek, G., Hardin, T., Kirchner, C.: HOL-λσ an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11(1), 1–25 (2001)

    Article  MathSciNet  Google Scholar 

  9. Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning 31(1), 33–72 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dowek, G., Miquel, A.: Cut elimination for Zermelo’s set theory (2006), available on authors’ web page

    Google Scholar 

  11. Dowek, G., Werner, B.: Proof normalization modulo. The Journal of Symbolic Logic 68(4), 1289–1316 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dowek, G., Werner, B.: Arithmetic as a theory modulo. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 423–437. Springer, Heidelberg (2005)

    Google Scholar 

  13. Goubault-Larrecq, J.: A note on the completeness of certain refinements of resolution. Research Report LSV-02-8, Laboratoire Spécification et Vérification, ENS Cachan, France (2002)

    Google Scholar 

  14. Hermant, O.: Méthodes Sémantiques en Déduction Modulo. Ph.D. thesis, École Polytechnique (2005)

    Google Scholar 

  15. Hermant, O.: Resolution is cut-free. Journal of Automated Reasoning 44(3), 245–276 (2009)

    Article  Google Scholar 

  16. Joiner Jr., W.H.: Resolution strategies as decision procedures. J. ACM 23(3), 398–417 (1976)

    Article  Google Scholar 

  17. Plotkin, G.: Building in equational theories. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 7, pp. 73–90. Edinburgh University Press, Edinburgh (1972)

    Google Scholar 

  18. Sutcliffe, G., Benzmüller, C., Brown, C.E., Theiss, F.: Progress in the development of automated theorem proving for higher-order logic. In: Schmidt, R.A. (ed.) Automated Deduction – CADE-22. LNCS, vol. 5663, pp. 116–130. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Wos, L., Robinson, G.A., Carson, D.F.: Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12(4), 536–541 (1965)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max Planck Institute for Informatics, Saarland University, Saarbrücken, Germany

    Guillaume Burel

Authors
  1. Guillaume Burel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Laboratory, University of Cambridge, J.J. Thomson Avenue, CB3 0FD, Cambridge, UK

    Anuj Dawar

  2. Formal Methods in Systems Engineering, Vienna University of Technology, Favoritenstr. 9-11, 1040, Vienna, Austria

    Helmut Veith

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burel, G. (2010). Embedding Deduction Modulo into a Prover. In: Dawar, A., Veith, H. (eds) Computer Science Logic. CSL 2010. Lecture Notes in Computer Science, vol 6247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15205-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15205-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15204-7

  • Online ISBN: 978-3-642-15205-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation