On the Complexity of Finding Second-Best Abductive Explanations

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-314071

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.