Two Normal Form Theorems for CSP Programs.
Krzysztof R. AptLuc BougéPhilippe ClermontPublished in: Inf. Process. Lett. (1987)
Keyphrases
- normal form
- database design
- constraint satisfaction problems
- relational databases
- relational algebra
- information content
- database theory
- nested relations
- functional dependencies
- boolean expressions
- data dependencies
- constraint satisfaction
- relational database theory
- constraint programming
- fixpoint
- np complete
- np hard
- constraint propagation
- belief revision
- database management systems
- prime implicates
- data warehouse