Stochastic boolean satisfiability

Journal of Automated Reasoning

Volumn 27, Issue 3, 2001, Pages 251-296

  Littman, Michael L ^c   Majercik, Stephen M ^a   Pitassi, Toniann ^b  

^a Duke University   (United States)

^b University of Arizona   (United States)

^c NONE

Author keywords

Artificial intelligence; Probability theory; Satisfiability

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

SATISFIABILITY PROBLEMS;

PROBABILISTIC LOGICS;

EID: 0035478853     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017584715408     Document Type: Article

References (47)

1. Using CSP look-back techniques to solve real-world SAT instances
2. Simplified and improved resolution lower bounds
3. On the complexity of unsatisfiability of random k-CNF formulas
4. Short proofs are narrow: Resolution made simple
5. The good old Davis-Putnam procedure helps counting models
6. Experimental analysis of the computational cost of evaluating quantified Boolean formulae
7. An algorithm to evaluate quantified Boolean formulae
8. Mick gets some (the odds are on bis side)
9. Using the Gröbner basis algorithm to find proofs of unsatisfiability
10. Random debators and the hardness of approximating stochastic functions
11. The complexity of stochastic games
12. Experimental results in the crossover point in random 3SAT
13. A machine program for theorem proving
14. Bucket elimination: A unifying framework for probabilistic inference
15. Analysis of two simple heuristics on a random instance of k-SAT
16. Algorithms for testing the satisfiability of propositional formulae
17. Beyond NP: The QSAT phase transition
18. A threshold for unsatisfiability
19. Algorithms for the satisfiability (SAT) problem: A survey
20. A computational study of satisfiability algorithms for propositional logic
21. Branching rules for satisfiability
22. Solving propositional satisfiability problems
23. Tail bounds for occupancy and the satisfiability threshold conjecture
24. Pushing the envelope: Planning, propositional logic, and stochastic search
25. A sparse sampling algorithm for near-optimal planning in large Markov decision processes
26. Approximating the unsatisfiability threshold of random formulas
27. Heuristics based on unit propagation for satisfiability problems
28. The computational complexity of probabilistic plan existence and evaluation
29. Probabilistic propositional planning: Representations and complexity
30. Nonapproximability results for partially observable Markov decision processes
31. MAXPLAN: A new approach to probabilistic planning
32. Contingent planning under uncertainty via probabilistic satisfiability
33. n steps
34. Complexity of finite-horizon Markov decision process problems
35. The complexity of Markov decision processes
36. Games against nature
37. An improved exponential time algorithm for k-SAT
38. Satisfiability coding lemma
39. On the hardness of approximate reasoning
40. Local search strategies for satisfiability testing
41. Generating hard satisfiability problems
42. Evaluating influence diagrams