On the complexity of second-best abductive explanations
International Journal of Approximate Reasoning, 2015
ABSTRACT While looking for abductive explanations of a given set of manifestations, an ordering b... more 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.
Uploads
Papers by Marco Schaerf
The SDL project aims to build an infrastructure supporting preservation, man- agement and dissemination of the past, present and future digital resources, that contain the overall intellectual production of the Sapienza University. The solu- tion adopted tries to find a tradeoff between the standardization of the digital processes and products (that allows a cost-effective centralized and shared management and curation), and the preservation of the peculiarities of scientific materials, belonging to disparate knowledge disciplines (that need to be digi- tally available for future initiatives, more specifically tailored to the designated communities).