On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination.
James RenegarPublished in: J. Symb. Comput. (1992)
Keyphrases
- decision problems
- quantifier elimination
- computational complexity
- quantifier free
- presburger arithmetic
- constraint databases
- special case
- first order logic
- constraint propagation
- functional programming
- np hard
- utility function
- cardinality constraints
- optimal policy
- linear constraints
- relational databases
- decision theory
- transitive closure
- fixed point
- expressive power
- np complete
- linear programming
- decision makers
- fuzzy sets
- query language
- expected utility theory