A semantic completeness proof for tamed

Authors:
Richard Bonichon;Olivier Hermant
Affiliations:
Université Paris 6 – LIP6, Paris, France;Université Paris 6 – LIP6, Paris, France
Venue:
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2006

Citing 8
Cited 2

First-order logic and automated theorem proving (2nd ed.)

First-order logic and automated theorem proving (2nd ed.)
The undecidability of simultaneous rigid E-unification

Theoretical Computer Science
What You Always Wanted to Know about Rigid E-Unification

Journal of Automated Reasoning
A Model-Based Completeness Proof of Extended Narrowing and Resolution

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Incremental Closure of Free Variable Tableaux

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Theorem Proving Modulo

Journal of Automated Reasoning
Semantic cut elimination in the intuitionistic sequent calculus

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Arithmetic as a theory modulo

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

Resolution is Cut-Free

Journal of Automated Reasoning
Experimenting with deduction modulo

CADE'11 Proceedings of the 23rd international conference on Automated deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deduction modulo is a theoretical framework designed to introduce computational steps in deductive systems. This approach is well suited to automated theorem proving and a tableau method for first-order classical deduction modulo has been developed. We reformulate this method and give an (almost constructive) semantic completeness proof. This new proof allows us to extend the completeness theorem to several classes of rewrite systems used for computations in deduction modulo. We are then able to build a counter-model when a proof fails for these systems.