Journal of Computer and System Sciences
The complexity of Markov decision processes
Mathematics of Operations Research
Operations Research
Algorithms for testing the satisfiability of propositional formulae
Journal of Logic Programming
The complexity of stochastic games
Information and Computation
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
On the hardness of approximate reasoning
Artificial Intelligence
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold for unsatisfiability
Journal of Computer and System Sciences
Random Debaters and the Hardness of Approximating Stochastic Functions
SIAM Journal on Computing
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
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
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae
AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Threshold phenomena in random graph colouring and satisfiability
Threshold phenomena in random graph colouring and satisfiability
Nonapproximability results for partially observable Markov decision processes
Journal of Artificial Intelligence Research
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Probabilistic propositional planning: representations and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Journal of Automated Reasoning
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
When plans distinguish Bayes nets
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
APPSSAT: Approximate probabilistic planning using stochastic satisfiability
International Journal of Approximate Reasoning
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Decision with uncertainties, feasibilities, and utilities: towards a unified algebraic framework
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Decision-theoretic bidding based on learned density models in simultaneous, interacting auctions
Journal of Artificial Intelligence Research
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Scenario-based stochastic constraint programming
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The inferential complexity of Bayesian and credal networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A new d-DNNF-based bound computation algorithm for functional E-MAJSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Leveraging belief propagation, backtrack search, and statistics for model counting
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
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
Evolving parameterised policies for stochastic constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Computing the density of states of Boolean formulas
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
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
On stopping evidence gathering for diagnostic Bayesian networks
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
MAP complexity results and approximation methods
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Algorithms for stochastic CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Decomposition of multi-operator queries on semiring-based graphical models
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of reachability in randomized sabotage games
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
APPSSAT: approximate probabilistic planning using stochastic satisfiability
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
The computational complexity of monotonicity in probabilistic networks
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Confidence bounds for statistical model checking of probabilistic hybrid systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Satisfiability problems and probabilistic models are core topics of artificial intelligence and computer science. This paper looks at the rich intersection between these two areas, opening the door for the use of satisfiability approaches in probabilistic domains. The paper examines a generic stochastic satisfiability problem, SSAT, which can function for probabilistic domains as SAT does for deterministic domains. It shows the connection between SSAT and well-studied problems in belief network inference and planning under uncertainty, and defines algorithms, both systematic and stochastic, for solving SSAT instances. These algorithms are validated on random SSAT formulae generated under the fixed-clause model. In spite of the large complexity gap between SSAT (PSPACE) and SAT (NP), the paper suggests that much of what we have learned about SAT transfers to the probabilistic domain.