Deciding co-observability is PSPACE-complete.

Kurt Rohloff Tae-Sic Yoo Stéphane Lafortune

Published in: IEEE Trans. Autom. Control. (2003)

Keyphrases

pspace complete
np complete
model checking
decision problems
satisfiability problem
strips planning
partially observable
exptime complete
tree automata
temporal logic
causal graph
search algorithm
np hard
hidden markov models
random variables
special case
data model
computational complexity