The Descriptive Complexity of Decision Problems through Logics with Relational Fixed-Point and Capturing Results.
Márcia FariasAna Teresa C. MartinsFrancicleber Martins FerreiraPublished in: LSFA (2016)
Keyphrases
- decision problems
- fixed point
- influence diagrams
- computational complexity
- pspace complete
- optimal strategy
- utility function
- default logic
- sufficient conditions
- game theoretic
- optimal policy
- bayesian decision problems
- np hard
- belief propagation
- decision processes
- floating point
- expressive power
- partially observable
- relational databases
- fixed point theorem
- dynamical systems
- machine learning
- state space
- data model
- bandit problems
- knowledge base