A Tranformation System for Deductive Databases Modules with Perfect Model Semantics

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.

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

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

[3]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[4]  中川 裕志,et al.  UNFOLD/FOLD TRANSFORMATION OF STRATIFIED PROGRAMS , 1989 .

[5]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

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

[7]  Carlo Zaniolo,et al.  The Generalized Counting Method for Recursive Logic Queries , 1986, ICDT.

[8]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

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

[10]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

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

[12]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

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

[14]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[15]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[16]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

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

[18]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[19]  Zhizhang Shen.  On the completeness of SLDNF-resolution , 1990 .

[20]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

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

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

[23]  John C. Shepherdson,et al.  Unfold/fold transformations of logic programs , 1992, Mathematical Structures in Computer Science.

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

[25]  Li-Yan Yuan,et al.  Three-valued formalization of logic programming: is it needed? , 1990, PODS '90.