On the Use of Non-deterministic Automata for Presburger Arithmetic.
Antoine Durand-GasselinPeter HabermehlPublished in: CONCUR (2010)
Keyphrases
- deterministic automata
- presburger arithmetic
- quantifier elimination
- finite automata
- algebraic structure
- decision procedures
- constraint propagation
- constraint databases
- functional programming
- database
- theorem proving
- regular expressions
- cardinality constraints
- first order logic
- programming language
- software engineering
- high level