Negative probabilities in probabilistic logic programs

DOI10.1016/J.IJAR.2016.10.001MaRDI QIDQ518605zbMATH OpenOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 29 March 2017

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2016.10.001

zbMATH Keywords

negationrepresentationcanonicalnegative probabilitycyclic logic programs

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• On the semantics and complexity of probabilistic logic programs
• Probabilistic logic programming with conditional constraints
• Probabilistic logic programming
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• Logic Programming

Cites work

• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Abducing through negation as failure: stable models within the independent choice logic
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Efficient computation for the noisy MAX
• Inhibited Effects in CP-Logic
• Markov Logic
• Markov logic networks
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Probabilistic graphical models.
• The independent choice logic for modelling multiple agents under uncertainty

Cited in

(8)

• GPS trajectory data segmentation based on probabilistic logic
• Generating negations of probability distributions
• Extended multi-adjoint logic programming
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• scientific article; zbMATH DE number 1149415 (Why is no real title available?)
• Logic Programming
• The complexity of Bayesian networks specified by propositional and relational languages
• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws

Describes a project that uses

Uses Software

• PRISM
• CP-logic
• ProbLog

This page was built for publication: Negative probabilities in probabilistic logic programs

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