A Semantic Completeness Proof for TaMeD - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A Semantic Completeness Proof for TaMeD

Richard Bonichon
  • Fonction : Auteur
  • PersonId : 984014
Olivier Hermant
  • Fonction : Auteur
  • PersonId : 984015

Résumé

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.

Dates et versions

hal-01337086 , version 1 (24-06-2016)

Identifiants

Citer

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⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More