Nonground Abductive Logic Programming with Probabilistic Integrity Constraints
From MaRDI portal
Publication:5019597
DOI10.1017/S1471068421000417MaRDI QIDQ5019597
Fabrizio Riguzzi, Evelina Lamma, Marco Gavanelli, Elena Bellodi, Riccardo Zese
Publication date: 10 January 2022
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03033
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Probabilistic Horn abduction and Bayesian networks
- Lifted discriminative learning of probabilistic logic programs
- On Minimality and Integrity Constraints in Probabilistic Abduction
- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
- Negation in logic programming
- The IFF proof procedure for abductive logic programming
- Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms: Theory, Implementations, and Complexity
- MAP Inference for Probabilistic Logic Programming
- Verifiable agent interaction in abductive logic programming
- Logic Programming
- Probabilistic Inductive Logic Programming
This page was built for publication: Nonground Abductive Logic Programming with Probabilistic Integrity Constraints