Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver

DOI10.1007/978-3-031-43619-2_24MaRDI QIDQ6545548zbMATH OpenFDO

Authors Martin Homola, Júlia Pukancová, Janka Boborová, Iveta Balintová

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_24

zbMATH Keywords

abductiondescription logicsontologies

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• On computing all abductive explanations from a propositional Horn theory
• scientific article; zbMATH DE number 512816
• The complexity of handling minimal solutions in logic-based abduction
• The complexity of handling minimal solutions in logic-based abduction
• The complexity of logic-based abduction

Cites work

• A theory of diagnosis from first principles
• A variant of Reiter's hitting-set algorithm
• An introduction to description logic
• Attributive concept descriptions with complements
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• Reducibility among combinatorial problems
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies

This page was built for publication: Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver

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