Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty.
Nian-Ze LeeJie-Hong R. JiangPublished in: CoRR (2019)
Keyphrases
- decision problems
- boolean satisfiability
- sat problem
- pspace complete
- satisfiability problem
- influence diagrams
- branch and bound algorithm
- utility function
- computational complexity
- max sat
- sat solvers
- randomly generated
- probabilistic planning
- np complete
- partially observable
- np hard
- symmetry breaking
- optimal policy
- upper bound
- sat instances
- expected utility
- phase transition
- decision processes
- decision theory
- integer linear programming
- knowledge representation
- decision makers
- special case
- lower bound
- conditional probabilities
- combinatorial optimization
- heuristic search
- graphical models