Algebraic computation of the weak well-founded model for general deductive databases

  • Rajiv Bagai
  • Rajshekhar Sunderraman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 826)


General logic programs are those that contain both positive and negative subgoals in their clause bodies. For such programs Fitting proposed an elegant 3-valued minimum model semantics that avoids some impracticalities of previous approaches. Here we present a method to compute this model for deductive databases. We introduce partial relations, which are the semantic objects associated with predicate symbols, and define algebraic operators over them. The first step in our model computation method is to convert the database rules into partial relation definitions involving these operators. The second step is to build the minimum model iteratively. We give algorithms for both steps and establish their termination and correctness. We also suggest extensions to our method for computing the well-founded model proposed by van Gelder, Ross and Schlipf.


Deductive databases Negation Weak well-founded semantics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann, Los Altos, 1988.Google Scholar
  2. 2.
    R. Bagai, M Bezem, and M. H. van Emden. On downward closure ordinals of logic programs. Fundamenta Informaticae, XIII(1):67–83, March 1990.Google Scholar
  3. 3.
    R. Bagai and R. Sunderraman. Algebraic computation of the Fitting model for general deductive databases. Technical Report WSUCS-93-2, Department of Computer Science, Wichita State University, April 1993.Google Scholar
  4. 4.
    N. Bidoit. Negation in rule-based database languages: a survey. Theoretical Computer Science, 78:3–83, 1991.Google Scholar
  5. 5.
    N. Bidoit and P. Legay. Well!: An evaluation procedure for all logic programs. In Proceedings of International Conference on Database Theory, pages 335–345. Lecture Notes in Computer Science, 470, Springer-Verlag, 1990.Google Scholar
  6. 6.
    W. Chen and D. S. Warren. A goal-oriented approach to computing well founded semantics. In Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, D.C. MIT Press, 1992.Google Scholar
  7. 7.
    M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 4:295–312, 1985.Google Scholar
  8. 8.
    M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, WA, August 1988.Google Scholar
  9. 9.
    D. B. Kemp, P. J. Stuckey, and D. Srivastava. Magic sets and bottom-up evaluation of well-founded models. In Proceedings of the 1991 International Symposium on Logic Programming, pages 337–354, San Diego, USA, 1991. The MIT Press.Google Scholar
  10. 10.
    N. Leone and P. Rullo. The safe computation of the well-founded semantics of datalog queries. Information Systems, 17(1):17–31, 1992.Google Scholar
  11. 11.
    K.-C. Liu and R. Sunderraman. A generalized relational model for indefinite and maybe information. IEEE Transactions on Knowledge and Data Engineering, 3(1):65–77, 1991.Google Scholar
  12. 12.
    Z. Manna and A. Shamir. The theoretical aspect of the optimal fixed point. SIAM Journal of Computing, 5:414–426, 1976.Google Scholar
  13. 13.
    T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, Los Altos, 1988.Google Scholar
  14. 14.
    K. A. Ross. Modular stratification and magic sets for datalog programs with negation. In Proceedings of the Ninth Annual ACM Symposium on Principles of database systems. ACM, 1990.Google Scholar
  15. 15.
    K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4:397–424, 1988.Google Scholar
  16. 16.
    R. Sunderraman. Deductive databases with conditional facts. In M. Worboys and A. F. Grundy, editors. Advances in Databases, pages 162–175. Lecture Notes in Computer Science, 696, Springer-Verlag, 1993. (Proceedings of the 11th British National Conference on Databases).Google Scholar
  17. 17.
    J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.Google Scholar
  18. 18.
    A. van Gelder. The alternating fixpoint of logic programs with negation. In Proceedings of the 8th ACM Symposium on Principles of Database Systems, pages 1–10, Philadelphia, USA, 1989. ACM Press.Google Scholar
  19. 19.
    A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):621–650, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Rajiv Bagai
    • 1
  • Rajshekhar Sunderraman
    • 1
  1. 1.Department of Computer ScienceThe Wichita State UniversityWichitaUSA

Personalised recommendations