Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols.
Vlad RusuElena ZinovievaPublished in: Electron. Notes Theor. Comput. Sci. (2001)
Keyphrases
- function symbols
- presburger arithmetic
- quantifier elimination
- first order logic
- logic programs
- normal form
- answer set programming
- algebraic structure
- database systems
- satisfiability problem
- constraint propagation
- horn clauses
- theorem proving
- consistency checking
- decision procedures
- finite state machines
- database
- constraint programming
- databases