Abduction with probabilistic logic programming under the distribution semantics

International Journal of Approximate Reasoning(2022)

引用 8|浏览16
暂无评分
摘要
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.
更多
查看译文
关键词
Abduction,Distribution semantics,Probabilistic logic programming,Statistical relational artificial intelligence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络