Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty.
Nian-Ze LeeJie-Hong R. JiangPublished in: AAAI (2021)
Keyphrases
- decision problems
- boolean satisfiability
- sat problem
- pspace complete
- satisfiability problem
- influence diagrams
- probabilistic planning
- np hard
- max sat
- optimal policy
- branch and bound algorithm
- sat solvers
- sat instances
- utility function
- integer linear programming
- computational complexity
- randomly generated
- partially observable
- np complete
- combinatorial problems
- knowledge representation
- phase transition
- decision theory
- expected utility
- symmetry breaking
- decision processes
- argumentation frameworks
- upper bound
- search space
- special case
- logic programming
- computational properties
- branch and bound
- belief functions