Journal of Computer and System Sciences
The complexity of Markov decision processes
Mathematics of Operations Research
On the hardness of approximate reasoning
Artificial Intelligence
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Contingent planning under uncertainty via stochastic satisfiability
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A machine program for theorem-proving
Communications of the ACM
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
Using weighted MAX-SAT engines to solve MPE
Eighteenth national conference on Artificial intelligence
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
Robust FPGA resynthesis based on fault-tolerant Boolean matching
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Performing incremental Bayesian inference by dynamic model counting
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Performing Bayesian inference by weighted model counting
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A new d-DNNF-based bound computation algorithm for functional E-MAJSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Stochastic satisfiability modulo theories for non-linear arithmetic
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Generalized craig interpolation for stochastic boolean satisfiability problems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Exploiting structure in weighted model counting approaches to probabilistic inference
Journal of Artificial Intelligence Research
MAP complexity results and approximation methods
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
An ACO algorithm for the most probable explanation problem
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
This paper looks at the rich intersection between satisfiability problems and probabilistic models, opening the door for the use of satisfiability approaches in probabilistic domains. A generic stochastic satisfiability problem is examined, which can function for probabilistic domains as SAT does for deterministic domains. The paper defines a Davis-Putnam-Logemann-Loveland-style procedure for solving stochastic satisfiability problems, and reports on a preliminary empirical exploration of the complexity of the algorithm for a collection of randomly generated probabilistic problems. The results exhibit the familiar easyhardest-hard pattern for the difficulty of random SAT formulae. Special cases of the stochastic satisfiability problem lie in different complexity classes, and one counterintuitive result is that the computational complexity and the empirical complexity of the problems examined do not track each other exactly-problems in the hardest complexity class are not the hardest to solve.