Login / Signup
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems.
Rakesh M. Verma
Published in:
Fundam. Informaticae (2009)
Keyphrases
</>
normal form
term rewriting
propositional formulas
nested relations
np complete
database design
functional dependencies
multi agent
data dependencies
theorem proving
relational algebra
decision problems
relational databases
artificial intelligence
desirable properties
database management systems
knuth bendix