Abduction with probabilistic logic programming under the distribution semantics

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of approximate reasoning Ročník 142; s. 41 - 63
Hlavní autoři: Azzolini, Damiano, Bellodi, Elena, Ferilli, Stefano, Riguzzi, Fabrizio, Zese, Riccardo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.03.2022
Témata:
Abduction
Distribution semantics
Probabilistic logic programming
Statistical relational artificial intelligence
Statistical relational artificial intelligence
Distribution semantics
Probabilistic logic programming
Abduction
ISSN:0888-613X, 1873-4731
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0888-613X
1873-4731
DOI:10.1016/j.ijar.2021.11.003