Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System.
David DelahayeMicaela MayeroPublished in: Calculemus (2005)
Keyphrases
- computer algebra
- quantifier elimination
- theorem prover
- first order logic
- presburger arithmetic
- automated theorem provers
- theorem proving
- functional programming
- constraint propagation
- cardinality constraints
- constraint databases
- computer algebra systems
- expressive power
- inference rules
- knowledge representation
- algebraic structure
- constraint satisfaction
- relational databases
- expert systems