.png){kind=icon}
Return
Abduction with probabilistic logic programming under the distribution semantics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2021.11.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In Probabilistic Abductive Logic Programming we are given a probabilistic logic program, a set of abducible facts, and a set of constraints. Inference in probabilistic abductive logic programs aims to find a subset of the abducible facts that is compatible with the constraints and that maximizes the joint probability of the query and the constraints. In this paper, we extend the PITA reasoner with an algorithm to perform abduction on probabilistic abductive logic programs exploiting Binary Decision Diagrams. Tests on several synthetic datasets show the effectiveness of our approach. (C) 2021 Elsevier Inc. All rights reserved.
Keywords:
Abduction
Distribution semantics
Probabilistic logic programming
Statistical relational artificial intelligence
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more