Abductive reasoning is a central task in artificial intelligence, which has been given semantics in the context of Probabilistic Logic Programming with the introduction of the class of probabilistic abductive logic programs (PALPs). In a nutshell, a PALP is a probabilistic logic program extended with a set of abducible facts. The goal is to find the optimal set of sets (possibly only one) of abducibles, called abductive explanation, such that the probability of a query is maximized. In this paper, we investigate the relation with Maximum-a-Posteriori detailing similarities and differences and provide a complexity study. Overall, this work provides a comprehensive characterization of abduction in Probabilistic Logic Programming.
Abduction in the Landscape of Probabilistic Logic Programming
Azzolini D.;
2026
Abstract
Abductive reasoning is a central task in artificial intelligence, which has been given semantics in the context of Probabilistic Logic Programming with the introduction of the class of probabilistic abductive logic programs (PALPs). In a nutshell, a PALP is a probabilistic logic program extended with a set of abducible facts. The goal is to find the optimal set of sets (possibly only one) of abducibles, called abductive explanation, such that the probability of a query is maximized. In this paper, we investigate the relation with Maximum-a-Posteriori detailing similarities and differences and provide a complexity study. Overall, this work provides a comprehensive characterization of abduction in Probabilistic Logic Programming.I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


