Abstract
We present a transformation system for deductive database (DDB) modules. We show that it preserves several data dependency properties of a DDB and is correct for the “perfect model” semantics of DDBs. Perfect models are not directly amenable to logical reasoning since logically equivalent DDBs may have different perfect models. We develop an approach which involves using a condition on data dependencies in DDBs (stratification compatibility) to pass from a logical equivalence to equivalence under perfect model semantics. This is readily applicable to the transformation system.
Cite
CITATION STYLE
Maher, M. J. (1989). A transformation system for deductive database modules with perfect model semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 405 LNCS, pp. 89–98). Springer Verlag. https://doi.org/10.1007/3-540-52048-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
