Fixpoint iteration with subsumption in deductive databases

Declarative languages for deductive and object-oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottom-up evaluation accordingly. Moreover, we provide a differential fixpoint operator for efficient query evaluation in deductive databases. This operator discards subsumed tuples on the fly. We also exemplify the ease of use of this programming methodology. In particular, we demonstrate how heuristic AI search procedures can be integrated into deductive databases in this way.

[1]  Divesh Srivastava,et al.  The valid model semantics for logic programs , 1992, PODS '92.

[2]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[3]  Werner Kießling,et al.  DBA*: Solving Combinatorial Problems with Deductive Databases , 1989, BTW.

[4]  Werner Kießling,et al.  Database Reasoning - A Deductive Framework for Solving Large and Complex Problems by Means of Subsumption , 1994, IS/KI.

[5]  Allen Van Gelder,et al.  The well-founded semantics of aggregation , 1992, PODS.

[6]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.

[7]  Werner Kießling,et al.  Database Support for Problematic Knowledge , 1992, EDBT.

[8]  Carlo Zaniolo,et al.  Negation and Aggregates in Recursive Rules: the LDL++ Approach , 1993, DOOD.

[9]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[10]  Werner Kießling,et al.  New direction for uncertainty reasoning in deductive databases , 1991, SIGMOD '91.

[11]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[12]  Werner Kießling,et al.  Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration , 1987, SLP.

[13]  Kenneth A. Ross,et al.  Monotonic aggregation in deductive databases , 1992, J. Comput. Syst. Sci..

[14]  James B. H. Kwa,et al.  BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm , 1989, Artif. Intell..

[15]  Keith Price,et al.  Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1. , 1980, SGAR.

[16]  Peter F. Patel-Schneider,et al.  A Four-Valued Semantics for Terminological Logics , 1989, Artif. Intell..

[17]  Werner Kießling,et al.  On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration , 1987, ICDE.

[18]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  John Grant,et al.  Logic-based approach to semantic query optimization , 1990, TODS.

[20]  S. Sudarshan,et al.  Aggregation and Relevance in Deductive Databases , 1991, VLDB.

[21]  Allen Van Gelder,et al.  Foundations of Aggregation in Deductive Databases , 1993, DOOD.

[22]  Sergio Greco,et al.  Minimum and maximum predicates in logic programming , 1991, PODS '91.

[23]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

[24]  Byeong Man Kim,et al.  A New Subsumption Method in the Connection Graph Proof Procedure , 1992, Theor. Comput. Sci..

[25]  Werner Kießling,et al.  Fixpoint Evaluation with Subsumption for Probabilistic Uncertainty , 1993, BTW.

[26]  Werner Kießling,et al.  The Differential Fixpoint Operator with Subsumption , 1993, DOOD.

[27]  Kotagiri Ramamohanarao,et al.  A Generalization of the Differential Approach to Recursive Query Evaluation , 1987, J. Log. Program..

[28]  Michael Kifer,et al.  A Logic Programming with Complex Objects , 1993, J. Comput. Syst. Sci..

[29]  Francesca Cesarini,et al.  Introducing Knowledge Representation Techniques in Database Models , 1991, AI*IA.

[30]  Hassan Aït-Kaci.  Type Subsumption as a Model of Computation , 1984, Expert Database Workshop.

[31]  Michael J. Maher,et al.  Déjà Vu in Fixpoints of Logic Programs ∗ , 1989 .