Stochastic Boolean satisfiability
From MaRDI portal
Publication:5956121
DOI10.1023/A:1017584715408zbMath0988.68189MaRDI QIDQ5956121
Michael L. Littman, Toniann Pitassi, Stephen M. Majercik
Publication date: 30 June 2002
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (26)
The Bayesian ontology language \(\mathcal {BEL}\) ⋮ Stochastic constraint programming: A scenario-based approach ⋮ Phase transitions of PP-complete satisfiability problems ⋮ Active inference and agency: optimal control without cost functions ⋮ A PCP theorem for interactive proofs and applications ⋮ A resolution proof system for dependency stochastic Boolean satisfiability ⋮ Confidence-based reasoning in stochastic constraint programming ⋮ On Imperfect Recall in Multi-Agent Influence Diagrams ⋮ Moving in a network under random failures: a complexity analysis ⋮ Most probable explanations in Bayesian networks: complexity and tractability ⋮ Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability ⋮ Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting ⋮ Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic ⋮ Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ On Stopping Evidence Gathering for Diagnostic Bayesian Networks ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems ⋮ Engineering constraint solvers for automatic analysis of probabilistic hybrid automata ⋮ APPSSAT: Approximate probabilistic planning using stochastic satisfiability ⋮ The Computational Complexity of Understanding Binary Classifier Decisions ⋮ Hybrid metaheuristics for stochastic constraint programming ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ Constraint solving in uncertain and dynamic environments: A survey
This page was built for publication: Stochastic Boolean satisfiability
