Connection-minimal abduction in EL via translation to FOL

DOI10.1007/978-3-031-10769-6_12MaRDI QIDQ2104508zbMATH OpenOpenAlexFDO

Authors Fajar Haifani, Patrick Koopmann, Sophie Tourret, Christoph Weidenbach

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A generic framework for implicate generation modulo theories
• ABox abduction in the description logic \(\mathcal{ALC}\)
• An introduction to description logic
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• ELK
• Generalized completeness for SOS resolution and its application to a new notion of relevance
• Modular reuse of ontologies: theory and practice
• Reasoning about explanations for negative query answers in \textit{DL-Lite}
• Resolution theorem proving
• SOLAR: An automated deduction system for consequence finding
• System Description: Spass Version 3.0
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• The OWL reasoner evaluation (ORE) 2015 competition report

Cited in

(2)

• An interactive SMT tactic in Coq using abductive reasoning
• Explaining reasoning results for description logic ontologies (invited paper)

Describes a project that uses

Uses Software

• ELK
• SPASS
• SOLAR

This page was built for publication: Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104508)