Probabilistic Reasoning by SAT Solvers

DOI10.1007/978-3-642-02906-6_57zbMath1245.68221OpenAlexW1855805902MaRDI QIDQ3638188

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)

Related Items (1)

Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework

Uses Software

• ASSAT
• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Contingent planning under uncertainty via stochastic satisfiability
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Fast planning through planning graph analysis
• A new approach to hybrid probabilistic logic programs
• A Logical Approach to Qualitative and Quantitative Reasoning
• Incomplete Knowledge in Hybrid Probabilistic Logic Programs
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Representing action and change by logic programs
• 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
• Logic Programming
• Formalizing sensing actions -- a transition function based approach

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