Experimenting with deduction modulo

Authors:
Guillaume Burel
Affiliations:
Énsiie/Cédric, Évry cedex, France
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 11
Cited 0

Term Indexing

Term Indexing
Normalisation by Evaluation

Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Theorem Proving Modulo

Journal of Automated Reasoning
The design and implementation of VAMPIRE

AI Communications - CASC
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
SPASS Version 3.5

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure

Journal of Automated Reasoning
Embedding pure type systems in the lambda-pi-calculus modulo

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Embedding deduction modulo into a prover

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A semantic completeness proof for tamed

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Arithmetic as a theory modulo

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.