Computer Science – Logic in Computer Science
Scientific paper
2012-04-26
Computer Science
Logic in Computer Science
Scientific paper
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.
Liberatore Paolo
Schaerf Marco
No associations
LandOfFree
On the Complexity of Finding Second-Best Abductive Explanations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Complexity of Finding Second-Best Abductive Explanations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Finding Second-Best Abductive Explanations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-314071