Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
From MaRDI portal
Publication:3616884
DOI10.1007/978-3-540-92243-8_5zbMath1229.68017OpenAlexW1589830626MaRDI QIDQ3616884
Publication date: 26 March 2009
Published in: Constraint Handling Rules (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92243-8_5
Related Items (4)
Super-Solutions ⋮ Abductive Logic Grammars ⋮ Abduction with probabilistic logic programming under the distribution semantics ⋮ Nonground Abductive Logic Programming with Probabilistic Integrity Constraints
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- First order compiler: A deterministic logic program synthesis algorithm
- Logic for improving integrity checking in relational data bases
- On the Relationship Between Abduction and Deduction
- Theory and practice of constraint handling rules
- Automated reasoning with a constraint-based metainterpreter
- The IFF proof procedure for abductive logic programming
- Abducing through negation as failure: stable models within the independent choice logic
- ACLP: Abductive Constraint Logic Programming
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- Verifiable agent interaction in abductive logic programming
- On the Implementation of Global Abduction
- Logic Programming
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming
- A Machine-Oriented Logic Based on the Resolution Principle
- CHR grammars
- Computational Logic in Multi-Agent Systems
- Modeling and Using Context
- Unnamed Item
- Unnamed Item
This page was built for publication: Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules