Skip to main content
SpringerLink
Log in

MædMax: A Maximal Ordered Completion Tool

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2018)

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

Included in the following conference series:

Abstract

The equational reasoning tool MædMax implements maximal ordered completion. This new approach extends the maxSMT-based method for standard completion developed by Klein and Hirokawa (2011) to ordered completion and equational theorem proving. MædMax incorporates powerful ground completeness checks and supports certification of its proofs by an Isabelle-based certifier. It also provides an order generation mode which can be used to synthesize term orderings for other tools. Experiments show the potential of our approach.

S. Winkler—Supported by FWF project T789.

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 EPUB and 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

Notes

  1. 1.

    http://cl-informatik.uibk.ac.at/software/maedmax/.

  2. 2.

    https://www.lri.fr/~marche/tpdb/format.html.

  3. 3.

    The Maxcomp version presented in [11] solves 91 KB examples within 60 s, too, but 98 problems in 600 s. For the other tools the numbers hardly change with a larger timeout. Maxcomp is not applicable to the other problem sets though.

  4. 4.

    http://categoricaldata.net/aql.html.

References

  1. Avenhaus, J., Hillenbrand, T., Löchner, B.: On using ground joinable equations in equational theorem proving. JSC 36(1–2), 217–233 (2003). https://doi.org/10.1016/S0747-7171(03)00024-5

    Article  MathSciNet  MATH  Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). https://doi.org/10.1017/CBO9781139172752

    Book  MATH  Google Scholar 

  3. Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Aït Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, Rewriting Techniques of Progress in Theoretical Computer Science, vol. 2, pp. 1–30. Academic Press, Cambridge (1989)

    Google Scholar 

  4. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the confluence of ordered term rewrite systems. ACM TOCL 4(1), 33–55 (2003). https://doi.org/10.1145/601775.601777

    Article  MathSciNet  MATH  Google Scholar 

  5. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81–94. Springer, Heidelberg (2006). https://doi.org/10.1007/11817963_11

    Chapter  Google Scholar 

  6. Hirokawa, N., Middeldorp, A., Sternagel, C., Winkler, S.: Infinite runs in abstract completion. In: Proceedings of the 2nd FSCD. LIPIcs, vol. 84, pp. 19:1–19:16 (2017). https://doi.org/10.4230/LIPIcs.FSCD.2017.19

  7. Klein, D., Hirokawa, N.: Maximal completion. In: Proceedings of the 22nd RTA. LIPIcs, vol. 10, pp. 71–80 (2011). https://doi.org/10.4230/LIPIcs.RTA.2011.71

  8. Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford (1970). https://doi.org/10.1016/B978-0-08-012975-4

    Chapter  MATH  Google Scholar 

  9. Kovács, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1–35. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39799-8_1

    Chapter  Google Scholar 

  10. Martin, U., Nipkow, T.: Ordered rewriting and confluence. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 366–380. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52885-7_100

    Chapter  Google Scholar 

  11. Sato, H., Winkler, S.: Encoding dependency pair techniques and control strategies for maximal completion. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS, vol. 9195, pp. 152–162. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21401-6_10

    Chapter  Google Scholar 

  12. Schultz, P., Wisnesky, R.: Algebraic data integration. JFP 27(e24), 51 (2017). https://doi.org/10.1017/S0956796817000168

    Article  MathSciNet  Google Scholar 

  13. Schulz, S.: Fingerprint indexing for paramodulation and rewriting. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 477–483. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31365-3_37

    Chapter  Google Scholar 

  14. Schulz, S.: System description: E 1.8. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR 2013. LNCS, vol. 8312, pp. 735–743. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-45221-5_49

    Chapter  Google Scholar 

  15. Sternagel, T.: Reliable confluence analysis of conditional term rewrite systems. Ph.D. thesis. University of Innsbruck (2017)

    Google Scholar 

  16. Sternagel, T., Winkler, S., Zankl, H.: Recording completion for certificates in equational reasoning. In: Proceedings of CPP 2015, pp. 41–47 (2015). https://doi.org/10.1145/2676724.2693171

  17. Sutcliffe, G.: The TPTP problem library and associated infrastructure: the FOF and CNF parts. JAR 43(4), 337–362 (2009). https://doi.org/10.1007/s10817-009-9143-8

    Article  MATH  Google Scholar 

  18. Winkler, S.: A ground joinability criterion for ordered completion. In: Proceedings of 6th IWC, pp. 45–49 (2017)

    Google Scholar 

Download references

Acknowledgements

The authors thank Ryan Wisnesky for sharing AQL problems, and the anonymous referees for their helpful comments.

Author information

Authors and Affiliations

  1. University of Innsbruck, Innsbruck, Austria

    Sarah Winkler & Georg Moser

Authors
  1. Sarah Winkler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sarah Winkler .

Editor information

Editors and Affiliations

  1. Université de Lorraine, Vandoeuvre-lès-Nancy, France

    Didier Galmiche

  2. Baden-Wuerttemberg Cooperative State University, Stuttgart, Germany

    Stephan Schulz

  3. University of Trento, Trento, Italy

    Roberto Sebastiani

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Winkler, S., Moser, G. (2018). MædMax: A Maximal Ordered Completion Tool. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds) Automated Reasoning. IJCAR 2018. Lecture Notes in Computer Science(), vol 10900. Springer, Cham. https://doi.org/10.1007/978-3-319-94205-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94205-6_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94204-9

  • Online ISBN: 978-3-319-94205-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation