The complexity of handling minimal solutions in logic-based abduction

DOI10.1093/logcom/exu053zbMath1331.68218OpenAlexW2159521617MaRDI QIDQ5262485

Reinhard Pichler, Andreas Pfandler, 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

zbMATH Keywords

computational complexitycounting complexityclosed-world assumptionpropositional abduction

Mathematics Subject Classification ID

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

Related Items (1)

Inference to the stable explanations

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