A Semantic Completeness Proof for TaMeD
From MaRDI portal
Publication:5387891
DOI10.1007/11916277_12zbMath1165.68451MaRDI QIDQ5387891
Richard Bonichon, Olivier Hermant
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11916277_12
Related Items
Experimenting with Deduction Modulo, Resolution is cut-free, First-order automated reasoning with theories: when deduction modulo theory meets practice, Regaining cut admissibility in deduction modulo using abstract completion