Journal of Computer and System Sciences
Resolution for quantified Boolean formulas
Information and Computation
Initial experiments in 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 Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Nonchronological Backtracking in Stochastic Boolean Satisfiability
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
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
Algorithms for stochastic CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Complexity of DNF and isomorphism of monotone formulas
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
| Hi-index | 0.00 |
The stochastic Boolean satisfiability (SSAT) problem was introduced by Papadimitriou in 1985 by adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, e.g., in probabilistic planning and, more recently by integrating arithmetic, in probabilistic model checking. In this paper, we first present a new result on the computational complexity of SSAT: SSAT remains PSPACE-complete even for its restriction to 2CNF. Second, we propose a sound and complete resolution calculus for SSAT complementing the classical backtracking search algorithms.