Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems.
Nicholas R. RadcliffeRakesh M. VermaPublished in: FSTTCS (2010)
Keyphrases
- normal form
- term rewrite systems
- function symbols
- database design
- functional dependencies
- relational databases
- rewrite rules
- database theory
- relational algebra
- nested relations
- first order logic
- formal definitions
- transitive closure
- logic programs
- prime implicates
- logic programming
- relational model
- database technology
- user defined
- expressive power