The complexity of handling minimal solutions in logic-based abduction

DOI10.3233/978-1-60750-606-5-895MaRDI QIDQ2999223zbMATH OpenFDO

Authors Reinhard Pichler, Stefan Woltran

Publication date 11 May 2011

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• The complexity of handling minimal solutions in logic-based abduction
• scientific article; zbMATH DE number 512816
• Complexity results for abductive logic programming
• The complexity of logic-based abduction
• Abduction from logic programs: Semantics and complexity

Cited in

(6)

• Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver
• Minimal inference problem over finite domains: the landscape of complexity
• The complexity of handling minimal solutions in logic-based abduction
• A method of solving abductive reasoning problems via hitting set
• Minimal abductive solutions with explicit justification
• Counting Complexity of Minimal Cardinality and Minimal Weight Abduction

This page was built for publication: The complexity of handling minimal solutions in logic-based abduction

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