Journal of Automated Reasoning

, Volume 13, Issue 1, pp 117–143 | Cite as

Ordered model trees: A normal form for disjunctive deductive databases

  • Adnan Yahya
  • José Alberto Fernández
  • Jack Minker
Article

Abstract

Model trees were conceived as a structure-sharing approach to represent information in disjunctive deductive databases. In this paper we introduce the concept ofordered minimal model trees as a normal form for disjunctive deductive databases. These are model trees in which an order is imposed on the elements of the Herbrand base. The properties of ordered minimal model trees are investigated as well as their possible utilization for efficient manipulation of disjunctive deductive databases. Algorithms are presented for constructing and performing operations on ordered model trees. The complexity of ordered model tree processing is addressed. Model forests are presented as an approach to reduce the complexity of ordered model tree construction and processing.

Key words

disjunctive deductive database ordered model trees indefinite information 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chang, C. L. and Lee, R. C. T.:Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.Google Scholar
  2. 2.
    Davis, M. and Putnam, H.: A computing procedure for quantification theory,J. ACM 7 (1960), 201–215.CrossRefGoogle Scholar
  3. 3.
    Fernández, J. A., Minker J., and Yahya, A.: Computing perfect and stable models using ordered model trees, Preprint, 1993.Google Scholar
  4. 4.
    Fernandez, J. A., Lobo, J., Minker, J., and Subrahmanian, V. S.: Disjunctive LP + integrity constraints — stable model semantics,Annals of Mathematics and Artificial Intelligence 8(3–4) (1993), 449–474.Google Scholar
  5. 5.
    Fernandez, J. A. and Minker, J.: Bottom-up evaluation of Hierarchical Disjunctive Deductive Databases, in Koichi Furukawa (ed.),Logic Programming Proceedings of the Eighth International Conference, MIT Press, 1991, pp. 660–675.Google Scholar
  6. 6.
    Fernandez, J. A. and Minker, J.: Bottom-up computation of perfect models for disjunctive theories. Presented at the ILPS'91 Workshop on Disjunctive Logic Programs, San Diego, California, 1991.Google Scholar
  7. 7.
    Gelfond, M. and Lifschitz, V.: The Stable Model Semantics for Logic Programming, in R. A. Kowalski and K. A. Bowen (eds.),Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle, Washington, 1988, pp. 1070–1080.Google Scholar
  8. 8.
    Liu, K.-C. and Sunderraman, R.: Indefinite and maybe information in relational databases,ACM Transactions on Database Systems 15(1) (1990), 1–39.Google Scholar
  9. 9.
    Liu, K.-C. and Sunderraman, R.: On representing indefinite and maybe information in relational databases: A generalization, inProc. of IEEE Data Engineering, Los Angeles, 1990, pp. 495–502.Google Scholar
  10. 10.
    Minker, J.: On indefinite databases and the closed world assumption, inLecture Notes in Computer Science 138, Springer-Verlag, 1982, pp. 292–308.Google Scholar
  11. 11.
    Przymusinski, T. C.: Perfect Model Semantics, in R. A. Kowalski and K. A. Bowen (eds.),Proc. 5th Int. Conf. and Symp. on Logic Programming, Seattle, Washington, 1988, pp. 1081–1096.Google Scholar
  12. 12.
    Purdom, P.: Solving satisfiability problems with less searching,IEEE Transactions on Pattern Analysis and Machine Intelligence 6 (1084), 510–515.Google Scholar
  13. 13.
    Suchenek, M. A.: Minimal models for closed world databases, in Z. W. Ras (ed.),Proc. of ISMIS 4, Elsevier, 1989, pp. 515–522.Google Scholar
  14. 14.
    Suchenek, M. A. and Sunderraman, R.: Minimal models for closed world databases with views, in Z. W. Ras and M. Zemankova (eds.),Proc. of ISMIS 5, Elsevier, 1990, pp. 182–193.Google Scholar
  15. 15.
    Yahya, A. and Henschen, L.: Deduction in non-horn databases,J. Automated Reasoning 1(2) (1985), 141–160.Google Scholar
  16. 16.
    Yuan, L. Y. and Chiang, D.-A.: A sound and complete query evaluation algorithm for relational databases with disjunctive information inProc. 8h Symp. on Principles of Database Systems, ACM Press, 1989, pp. 66–74.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • Adnan Yahya
    • 1
  • José Alberto Fernández
    • 2
  • Jack Minker
    • 2
  1. 1.Electrical Engineering DepartmentBirzeit UniversityBirzeit, West Bank
  2. 2.Computer Science DepartmentUniversity of MarylandCollege ParkUSA
  3. 3.Bull HN Informations Systems Inc.Phoenix

Personalised recommendations