On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic.
Gergely KovásznaiHelmut VeithAndreas FröhlichArmin BierePublished in: MFCS (2) (2014)
Keyphrases
- decision problems
- bit vector
- influence diagrams
- computational complexity
- decision model
- asynchronous circuits
- multiple criteria
- optimal strategy
- utility function
- decision processes
- multicriteria decision
- optimal policy
- np hard
- pspace complete
- verification method
- partially observable
- machine learning
- model checking
- logic programming
- sequential decision making
- bounded treewidth
- decision making
- modal logic
- probability distribution
- lower bound
- minimax regret
- bayesian decision problems