A class of Prioritized Abductive Logic Programs (PrioALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with best-first search. Priorities may represent probabilities or a cost function to be optimized. Compared with other weighted and probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers. A PrioALP is translated in a systematic way into a CHR program which serves as a query interpreter, and the resulting CHR code describes in a highly concise way, the strategies applied in the search for explanations.
Chr 2008, the 5th Workshop on Constraint Handling Rules, 2008, p. 159-173
Main Research Area:
Risc-linz Report Series
CHR 2008, The 5th Workshop on Constraint Handling Rules