A Semantic Completeness Proof for TaMeD

Richard Bonichon 1 Olivier Hermant 1
1 SPI - Sémantiques, preuves et implantation
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01337086
Contributor : Lip6 Publications <>
Submitted on : Friday, June 24, 2016 - 2:31:23 PM
Last modification on : Thursday, March 21, 2019 - 1:07:25 PM

Links full text

Identifiers

Citation

Richard Bonichon, Olivier Hermant. A Semantic Completeness Proof for TaMeD. Logic for Programming, Artificial Intelligence, and Reasoning, (LPAR), Nov 2006, Phnom Penh, Cambodia. pp.167-181, ⟨10.1007/11916277_12⟩. ⟨hal-01337086⟩

Share

Metrics

Record views

64