Experimenting with Deduction Modulo

Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and propositions. In CSL 2010, LNCS 6247, p.155–169, we gave theoretical justifications why it is possible to embed a proof search method based on deduction modulo, namely Ordered Polarized Resolution Modulo, into an existing prover. Here, we describe the implementation of these ideas, starting from iProver. We test it by confronting Ordered Polarized Resolution Modulo and other proofsearch calculi, using benchmarks extracted from the TPTP Library. For the integration of rewriting, we also compare several implementation techniques, based for instance on discrimination trees or on compilation. These results reveal that deduction modulo is a promising approach to handle proof search in theories in a generic but efficient way. Since proofs are rarely searched for without context, there is a strong need to be able to han...

• Type: Journal
• Year: 2011
• Where: CADE
• Authors: Guillaume Burel
• Keywords: CADE 2011, Logical Reasoning, Theorem Prover, Theorem Provers, Tptp Library