The complexity of handling minimal solutions in logic-based abduction

DOI10.1093/LOGCOM/EXU053zbMATH Open1331.68218OpenAlexW2159521617MaRDI QIDQ5262485FDOQ5262485

Authors: Andreas Pfandler, Reinhard Pichler, Stefan Woltran 

Publication date: 15 July 2015

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exu053

Recommendations

• The complexity of handling minimal solutions in logic-based abduction
• scientific article; zbMATH DE number 512816
• Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
• The complexity of logic-based abduction
• Abduction from logic programs: Semantics and complexity

zbMATH Keywords

computational complexitycounting complexityclosed-world assumptionpropositional abduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Cited In (6)

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

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 Q5262485)