On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability

DOI10.1007/978-3-540-87993-0_28zbMath1245.68220OpenAlexW1571300093MaRDI QIDQ3534675

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)

Related Items (2)

Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework ⋮ Probabilistic Reasoning by SAT Solvers

Cites Work

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

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