Generalized completeness for SOS resolution and its application to a new notion of relevance
From MaRDI portal
Publication:2055868
DOI10.1007/978-3-030-79876-5_19OpenAlexW3181671299MaRDI QIDQ2055868
Fajar Haifani, Sophie Tourret, Christoph Weidenbach
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-79876-5_19
Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Set of support, demodulation, paramodulation: a historical perspective ⋮ A posthumous contribution by Larry Wos: excerpts from an unpublished column ⋮ Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL ⋮ Semantic relevance
Cites Work
- Unnamed Item
- Unnamed Item
- Investigations on autark assignments
- Axiom Pinpointing in General Tableaux
- Labelled Clauses
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- The complexity of logic-based abduction
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- A Machine-Oriented Logic Based on the Resolution Principle
