Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.
Jarmo KontinenPublished in: Stud Logica (2013)
Keyphrases
- quantifier free
- rewrite systems
- first order logic
- computational complexity
- quantifier elimination
- real numbers
- term rewriting
- relational data model
- expressive power
- np complete
- theorem proving
- active rules
- constraint propagation
- functional programming
- np hard
- constraint databases
- inference rules
- boolean formula
- logic programming
- operational semantics
- theorem prover
- relational algebra
- knowledge representation
- data model