First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice

@article{Burel2019FirstOrderAR,
  title={First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice},
  author={G. Burel and Guillaume Bury and Rapha{\"e}l Cauderlier and D. Delahaye and Pierre Halmagrand and O. Hermant},
  journal={Journal of Automated Reasoning},
  year={2019},
  volume={64},
  pages={1001 - 1050}
}
We discuss the practical results obtained by the first generation of automated theorem provers based on Deduction modulo theory. In particular, we demonstrate the concrete improvements such a framework can bring to first-order theorem provers with the introduction of a rewrite feature. Deduction modulo theory is an extension of predicate calculus with rewriting both on terms and propositions. It is well suited for proof search in theories because it turns many axioms into rewrite rules. We… Expand
From Axioms to Rewriting Rules
Automated Reasoning with Restricted Intensional Sets

References

SHOWING 1-10 OF 129 REFERENCES
Embedding Deduction Modulo into a Prover
Theorem Proving Modulo
Solving quantified verification conditions using satisfiability modulo theories
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
  • G. Burel
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2011
First-Order Logic and Automated Theorem Proving
  • M. Fitting
  • Mathematics, Computer Science
  • Graduate Texts in Computer Science
  • 1996
Refutational theorem proving for hierarchic first-order theories
Arithmetic as a Theory Modulo
A Semantic Completeness Proof for TaMeD
...
1
2
3
4
5
...