Abducing through negation as failure: stable models within the independent choice logic

DOI10.1016/S0743-1066(99)00071-0MaRDI QIDQ4484722zbMATH OpenFDO

Authors

Publication date 25 May 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(99)00071-0

zbMATH Keywords

acyclic logic programsindependent choice logic

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• The Independent Choice Logic and Beyond
• Extended semantics and inference for the Independent Choice Logic
• Abductive Logic Programming
• An abductive framework for negation in disjunctive logic programming
• An abductive framework for extended logic programming

Cited in

(29)

• The independent choice logic for modelling multiple agents under uncertainty
• Tableau reasoning for description logics and its extension to probabilities
• Causal inference in cplint
• Abduction with probabilistic logic programming under the distribution semantics
• Handling epistemic and aleatory uncertainties in probabilistic circuits
• A semantics for hybrid probabilistic logic programs with function symbols
• Complexity results for probabilistic answer set programming
• Lifted discriminative learning of probabilistic logic programs
• The PITA system: tabling and answer subsumption for reasoning under uncertainty
• Probabilistic Rule Learning in Nonmonotonic Domains
• The distribution semantics for normal programs with function symbols
• A Logical Approach to Qualitative and Quantitative Reasoning
• Probabilistic reasoning with answer sets
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
• Constraint-based probabilistic modeling for statistical abduction
• ILP turns 20. Biography and future challenges
• Dialectical Proof Procedures for Probabilistic Abstract Argumentation
• MAP inference for probabilistic logic programming
• Negative probabilities in probabilistic logic programs
• On the complexity of propositional and relational credal networks
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• The Independent Choice Logic and Beyond
• On the Efficient Execution of ProbLog Programs
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Forecasting with jury-based probabilistic argumentation
• A distribution semantics for probabilistic term rewriting
• A semantics for probabilistic hybrid knowledge bases with function symbols
• Probabilistic (logic) programming concepts
• An OpenCL implementation of a forward sampling algorithm for CP-logic

This page was built for publication: Abducing through negation as failure: stable models within the independent choice logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484722)