Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
Probabilistic Horn abduction is a simple framework to combine probabilistic and logical reasoning into a coherent practical framework. The numbers can be consistently interpreted ...
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
Abductive inference has long been associated with the logic of scientific discovery and automated abduction is now being used in real scientific tasks. But few methods can exploi...