On Derived Dependencies and Connected Databases

Abstract This paper introduces a new class of deductive databases ( connected databases ) for which SLDNF-resolution never flounders and always computes ground answers. The class of connected databases properly includes that of allowed databases. Moreover the definition of connected databases enables evaluable predicates to be included in a uniform way. An algorithm is described which, for each predicate defined in a normal database, derives a propositional formula ( groundness formula ) describing dependencies between the arguments of that predicate. Groundness formulae are used to determine whether a database is connected. They are also used to identify goals for which SLDNF-resolution will never flounder and will always compute ground answers on a connected database.

[1]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[2]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[3]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

[4]  Saumya K. Debray,et al.  Efficient dataflow analysis of logic programs , 1988, JACM.

[5]  Rodney W. Topor,et al.  Domain-Independent Formulas and Databases , 1987, Theor. Comput. Sci..

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

[7]  Abraham Silberschatz,et al.  An axiomatic approach to deciding query safety in deductive databases , 1988, PODS '88.

[8]  Saumya K. Debray,et al.  Automatic Mode Inference for Prolog Programs , 1986, SLP.

[9]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..

[10]  Robert Demolombe.  Syntactical characterization of a subset of domain-independent formulas , 1992, JACM.

[11]  Gerda Janssens,et al.  An Instance of Abstract Interpretation Integrating Type and Mode Inferencing , 1988, ICLP/SLP.

[12]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

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

[14]  John W. Lloyd,et al.  A Logical Reconstruction of Prolog II , 1984, J. Log. Program..

[15]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[16]  Saumya K. Debray,et al.  On the Practicality of Global Flow Analysis of Logic Programs , 1988, ICLP/SLP.

[17]  Liz Sonenberg,et al.  On Domain Independent Databases , 1988, Foundations of Deductive Databases and Logic Programming..