MædMax: a maximal ordered completion tool

DOI10.1007/978-3-319-94205-6_31MaRDI QIDQ1799107zbMATH OpenOpenAlexFDO

Authors Sarah Winkler, Georg Moser

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94205-6_31

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Order-sorted completion: The many-sorted way
• Extending Maximal Completion (Invited Talk)
• scientific article; zbMATH DE number 2033276
• Encoding dependency pair techniques and control strategies for maximal completion
• Maximal completion
• Maximal label search algorithms to compute perfect and minimal elimination orderings
• Max-ASP: Maximum Satisfiability of Answer Set Programs

Cited in

(10)

• Twee: an equational theorem prover
• Ground joinability and connectedness in the superposition calculus
• AC simplifications and closure redundancies in the superposition calculus
• Certified equational reasoning via ordered completion
• MadMax
• Automatically Proving and Disproving Feasibility Conditions
• Extending Maximal Completion (Invited Talk)
• Maximal completion
• Termination tools in ordered completion
• Weighted Path Orders Are Semantic Path Orders

Describes a project that uses

Uses Software

• E Theorem Prover
• VAMPIRE
• TPTP

This page was built for publication: MædMax: a maximal ordered completion tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799107)