Stochastic Boolean satisfiability
From MaRDI portal
Publication:5956121
DOI10.1023/A:1017584715408zbMATH Open0988.68189MaRDI QIDQ5956121FDOQ5956121
Authors: Michael L. Littman, Stephen M. Majercik, Toniann Pitassi 
Publication date: 30 June 2002
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cited In (33)
- The computational complexity of understanding binary classifier decisions
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- Stochastic decision Petri nets
- Stochastic constraint programming: A scenario-based approach
- Reasoning and inference for (maximum) satisfiability: new insights
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
- Moving in a network under random failures: a complexity analysis
- Most probable explanations in Bayesian networks: complexity and tractability
- A resolution proof system for dependency stochastic Boolean satisfiability
- On stopping evidence gathering for diagnostic Bayesian networks
- Active inference and agency: optimal control without cost functions
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- Resolution for stochastic Boolean satisfiability
- Generalized Craig interpolation for stochastic Boolean satisfiability problems
- Stochastic Boolean satisfiability
- On Imperfect Recall in Multi-Agent Influence Diagrams
- Confidence-based reasoning in stochastic constraint programming
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- A PCP theorem for interactive proofs and applications
- Stochastic systematic search algorithms for satisfiability
- Phase transitions of PP-complete satisfiability problems
- A New Algorithm for Complex Stochastic Boolean Systems
- Contingent planning under uncertainty via stochastic satisfiability
- Open-world probabilistic databases: semantics, algorithms, complexity
- The Bayesian ontology language \(\mathcal {BEL}\)
- Leveraging belief propagation, backtrack search, and statistics for model counting
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
- Hybrid metaheuristics for stochastic constraint programming
- Constraint solving in uncertain and dynamic environments: A survey
- Critical Behavior in the Satisfiability of Random Boolean Expressions
This page was built for publication: Stochastic Boolean satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956121)
