Probabilistic Reasoning by SAT Solvers

DOI10.1007/978-3-642-02906-6_57MaRDI QIDQ3638188zbMATH OpenOpenAlexFDO

Authors Emad W. Saad

Publication date 2 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02906-6_57

Mathematics Subject Classification ID

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

Recommendations

• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Contingent planning under uncertainty via stochastic satisfiability
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Resolution for stochastic Boolean satisfiability
• Mechanizing Mathematical Reasoning

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• A Logical Approach to Qualitative and Quantitative Reasoning
• A new approach to hybrid probabilistic logic programs
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Contingent planning under uncertainty via stochastic satisfiability
• Fast planning through planning graph analysis
• Formalizing sensing actions -- a transition function based approach
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• Logic Programming
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Planning and acting in partially observable stochastic domains
• Reasoning about actions with sensing under qualitative and probabilistic uncertainty
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Representing action and change by logic programs
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

Cited in

(11)

• Probabilistic satisfiability
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• A probabilistic study on the satisfiability problem
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Probabilistic reasoning with answer sets
• scientific article; zbMATH DE number 69384 (Why is no real title available?)
• scientific article; zbMATH DE number 1784977 (Why is no real title available?)
• Sampling-based SAT/ASP multi-model optimization as a framework for probabilistic inference
• Probabilistic approach to the satisfiability problem

Describes a project that uses

Uses Software

• Graphplan
• ASSAT

This page was built for publication: Probabilistic Reasoning by SAT Solvers

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