The Independent Choice Logic and Beyond

DOI10.1007/978-3-540-78652-8_8zbMath1137.68596OpenAlexW1563950057MaRDI QIDQ5452027

No author found.

Publication date: 28 March 2008

Published in: Probabilistic Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78652-8_8

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (22)

A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics ⋮ The distribution semantics for normal programs with function symbols ⋮ Unnamed Item ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Introduction to the special issue on probability, logic and learning ⋮ Probabilistic (logic) programming concepts ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ A landscape and implementation framework for probabilistic rough sets using \textsc{ProbLog} ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ ILP turns 20. Biography and future challenges ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Learning Effect Axioms via Probabilistic Logic Programming ⋮ Unnamed Item ⋮ A neural cognitive model of argumentation with application to legal inference and decision making ⋮ SLAP: specification logic of actions with probability ⋮ Learning to rank in PRISM ⋮ Speeding up parameter and rule learning for acyclic probabilistic logic programs ⋮ Competing hypotheses and abductive inference ⋮ A general approach to reasoning with probabilities ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ Probabilistic abstract argumentation frameworks, a possible world view

Cites Work

• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Probabilistic Horn abduction and Bayesian networks
• The independent choice logic for modelling multiple agents under uncertainty
• Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
• Answer set programming and plan generation
• Inference in hybrid Bayesian networks with mixtures of truncated exponentials
• Markov logic networks
• Compiling relational Bayesian networks for exact inference
• A methodology for using a default and abductive reasoning system
• Inductive Logic Programming: Theory and methods
• Efficient computation for the noisy MAX
• Abducing through negation as failure: stable models within the independent choice logic
• Logic Programming and Nonmonotonic Reasoning
• Recursive conditioning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Independent Choice Logic and Beyond