On the Complexity of Abduction

Authors:
Victor W. Marek;Anil Nerode;Jeffrey B. Remmel
Affiliations:
-;-;-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 1
Cited 2

Complexity Results for Abductive Logic Programming

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning

Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
My work with Victor Marek: a mathematician looks at answer set programming

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.