Compilability of propositional abduction

Paolo Liberatore and Marco Schaerf

ACM Transactions on Computational Logic

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.

 title = {Compilability of propositional abduction},
 year = {2007},
 author = {Liberatore, Paolo and Schaerf, Marco},
 journal = {ACM Transactions on Computational Logic},
 pages = {2},
 number = {1},
 volume = {8},
HTTP download.
doi: 10.1145/1182613.1182615