A Transformation System for Deductive Database Modules with Perfect Model Semantics

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.

[1]  Hirohisa Seki,et al.  Unfold/Fold Transformation of Stratified Programs. , 1989 .

[2]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[3]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[5]  Hisao Tamaki,et al.  Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

[6]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[7]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[8]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[9]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[10]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[11]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.