Title :
On the complexity of abduction
Author :
Marek, Victor W. ; Nerode, Anil ; Remmel, Jeffrey B.
Author_Institution :
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
Abstract :
In this paper we consider the complexity of the existence problem for explanations and for minimal explanations for abductive frameworks based on finite predicate programs. We find that although, in general, the problem is very complex, there are classes of frameworks for which the problem is much simpler
Keywords :
explanation; formal logic; logic programming; abduction; abductive frameworks; complexity; existence problem; finite predicate programs; minimal explanations; Back; Chemistry; Computer science; Electronic mail; Humans; Inspection; Logic; Mathematics; Physics;
Conference_Titel :
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location :
New Brunswick, NJ
Print_ISBN :
0-8186-7463-6
DOI :
10.1109/LICS.1996.561468
