On the complexity of abduction
Victor W. Marek, Anil Nerode, Jeffrey B. Remmel · 2002
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.