On the Complexity of Finding Second-Best Abductive Explanations
Logic in Computer Science
2021-04-09 v3 Artificial Intelligence
Abstract
While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed. The complexity of finding/verifying optimal solutions is already known. In this paper we consider the computational complexity of finding second-best solutions. We consider different orderings, and consider also different possible definitions of what a second-best solution is.
Cite
@article{arxiv.1204.5859,
title = {On the Complexity of Finding Second-Best Abductive Explanations},
author = {Paolo Liberatore and Marco Schaerf},
journal= {arXiv preprint arXiv:1204.5859},
year = {2021}
}