Finding good proofs for description logic entailments using recursive quality measures

DOI10.1007/978-3-030-79876-5_17OpenAlexW3177831581MaRDI QIDQ2055864

Stefan Borgwardt, Alisa Kovtunova, Franz Baader, Patrick Koopmann, Christian Alrabbaa

Publication date: 1 December 2021

Full work available at URL: https://arxiv.org/abs/2104.13138

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (4)

Efficiently explaining CSPs with unsatisfiable subset optimization ⋮ Finding good proofs for description logic entailments using recursive quality measures ⋮ Theorem proving as constraint solving with coherent logic ⋮ Evonne: interactive proof visualization for description logics (system description)

Cites Work

• Unnamed Item
• Directed hypergraphs and applications
• Finding good proofs for description logic entailments using recursive quality measures
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• An Introduction to Description Logic
• Reconstructing proofs at the assertion level
• Mechanizing Mathematical Reasoning

This page was built for publication: Finding good proofs for description logic entailments using recursive quality measures