Sciweavers

2018 search results - page 5 / 404
» Code Normal Forms
Sort
View
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 10 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
ACSC
2007
IEEE
14 years 4 months ago
Domination Normal Form - Decomposing Relational Database Schemas
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
Henning Köhler
DM
2006
73views more  DM 2006»
13 years 9 months ago
Composition of Post classes and normal forms of Boolean functions
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
JAIR
2008
92views more  JAIR 2008»
13 years 9 months ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
IGPL
2002
80views more  IGPL 2002»
13 years 9 months ago
Ultimate Normal Forms for Parallelized Natural Deductions
The system of natural deduction that originated with Gentzen (1934
Neil Tennant