On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

DOI10.1007/978-3-540-87993-0_28MaRDI QIDQ3534675zbMATH OpenOpenAlexFDO

Authors Emad W. Saad

Publication date 4 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87993-0_28

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Recommendations

• Probabilistic Reasoning by SAT Solvers
• Resolution for stochastic Boolean satisfiability
• A semantics for hybrid probabilistic logic programs with function symbols
• Stochastic Boolean satisfiability
• A hybrid method for probabilistic satisfiability

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1875392 (Why is no real title available?)
• A Logical Approach to Qualitative and Quantitative Reasoning
• A machine program for theorem-proving
• A new approach to hybrid probabilistic logic programs
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• ASSAT: computing answer sets of a logic program by SAT solvers
• Combining probabilistic logic programming with the power of maximum entropy
• Contingent planning under uncertainty via stochastic satisfiability
• Games against nature
• Hybrid probabilistic programs
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Probabilistic logic programming
• Stable semantics for probabilistic deductive databases
• Stochastic Boolean satisfiability
• The independent choice logic for modelling multiple agents under uncertainty

Cited in

(4)

• Hybrid probabilistic logic programs as residuated logic programs
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• Probabilistic Reasoning by SAT Solvers
• Logic Programming

This page was built for publication: On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

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