DeepAI AI Chat
Log In Sign Up

Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty

by   Nian-Ze Lee, et al.

Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model decision problems with uncertainty, such as Partially Observable Markov Decision Process (POMDP). SSAT, however, is limited by its descriptive power within the PSPACE complexity class. More complex problems, such as the NEXPTIME-complete Decentralized POMDP (Dec-POMDP), cannot be succinctly encoded with SSAT. To provide a logical formalism of such problems, we generalize Dependency Quantified Boolean Formula (DQBF), a representative problem in the NEXPTIME-complete class, to its stochastic variant, named Dependency SSAT (DSSAT), and show that DSSAT is also NEXPTIME-complete. To demonstrate the descriptive power of DSSAT, we further establish a polynomial-time reduction from Dec-POMDP to DSSAT. Our results may encourage DSSAT solver development to enable potential broad applications.


page 1

page 2

page 3

page 4


Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...

Quantified boolean formula problem

This paper is devoted to the complexity of the quantified boolean formul...

Reducing NEXP-complete problems to DQBF

We present an alternative proof of the NEXP-hardness of the satisfiabili...

The Partially Observable History Process

We introduce the partially observable history process (POHP) formalism f...

The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis

We aim at investigating the solvability/insolvability of nondeterministi...

Quantifier Localization for DQBF

Dependency quantified Boolean formulas (DQBFs) are a powerful formalism,...

Perturbative methods for mostly monotonic probabilistic satisfiability problems

The probabilistic satisfiability of a logical expression is a fundamenta...