Quantifier-free logic for nondeterministic theories.
Yngve LamoMichal WalickiPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- quantifier free
- rewrite systems
- first order logic
- quantifier elimination
- satisfiability modulo theories
- real numbers
- term rewriting
- relational data model
- theorem proving
- active rules
- expressive power
- constraint databases
- theorem prover
- constraint propagation
- answer set programming
- cardinality constraints
- inference rules
- database
- functional programming
- relational algebra
- knowledge representation
- machine learning