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.
On the Complexity of Finding Second-Best Abductive Explanations / Liberatore, Paolo; Schaerf, Marco. - ELETTRONICO. - -:(2012), pp. ---.
On the Complexity of Finding Second-Best Abductive Explanations
LIBERATORE, Paolo;SCHAERF, Marco
2012
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.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.