Login / Signup
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth.
Martin Fürer
Published in:
Theor. Comput. Sci. (1982)
Keyphrases
</>
quantifier elimination
presburger arithmetic
constraint propagation
first order logic
constraint databases
cardinality constraints
databases
relational databases
constraint satisfaction
fixed point
functional programming