Computing the Well-Founded Model of Deductive Databases

The well-founded model is one of the most popular models of general logic programs, i.e. logic programs with negation in the bodies of clauses. We present a method for constructing this model for general deductive databases, which are logic programs without any function symbols. The method adopts paraconsistent relations as the semantic objects associated with the predicate symbols of the database. Paraconsistent relations are a generalization of ordinary relations in that they allow manipulation of incomplete as well as inconsistent information. The first step in the model construction method is to transform the database clauses into paraconsistent relation definitions involving these operators. The second step is to build the well-founded model iteratively. Algorithms for both steps are presented and their termination and correctness is also established.

[1]  P. Legay,et al.  WELL!: An Evaluation Procedure for All Logic Programs , 1990, ICDT.

[2]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

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

[4]  M. Bezem,et al.  On downward closure ordinals of logic programs , 1990 .

[5]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

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

[7]  Rajshekhar Sunderraman,et al.  A paraconsistent relational data model , 1995, Int. J. Comput. Math..

[8]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[9]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[10]  Divesh Srivastava,et al.  Magic Sets and Bottom-Up Evaluation of Well-Founded Models , 1991, ISLP.

[11]  Raghu Ramakrishnan,et al.  Performance Evaluation of Data Intensive Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[12]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

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

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

[15]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[16]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[17]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[18]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[19]  K. A. Ross.  Modular stratification and magic sets for DATALOG programs with negation , 1990, PODS 1990.

[20]  R. Sunderraman,et al.  A Generalized Relational Model for Indefinite and Maybe Information , 1991, IEEE Trans. Knowl. Data Eng..

[21]  Nicola Leone,et al.  Safe computation of the well-founded semantics of Datalog queries , 1992, Inf. Syst..

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

[23]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

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