Computer Science – Artificial Intelligence
Scientific paper
2002-10-09
Computer Science
Artificial Intelligence
Scientific paper
10.1145/1182613.1182615
Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems such as diagnosis. In this paper we investigate whether the computational complexity of abduction can be reduced by an appropriate use of preprocessing. This is motivated by the fact that part of the data of the problem (namely, the set of all possible assumptions and the theory relating assumptions and manifestations) are often known before the rest of the problem. In this paper, we show some complexity results about abduction when compilation is allowed.
Liberatore Paolo
Schaerf Marco
No associations
LandOfFree
Compilability of Abduction 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 Compilability of Abduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compilability of Abduction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-204599