Skip to main content
SpringerLink
Log in

Ordered model trees: A normal form for disjunctive deductive databases

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chang, C. L. and Lee, R. C. T.:Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.

    Google Scholar 

  2. Davis, M. and Putnam, H.: A computing procedure for quantification theory,J. ACM 7 (1960), 201–215.

    Article  Google Scholar 

  3. Fernández, J. A., Minker J., and Yahya, A.: Computing perfect and stable models using ordered model trees, Preprint, 1993.

  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. 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.

  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.

  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.

  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. 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.

  10. Minker, J.: On indefinite databases and the closed world assumption, inLecture Notes in Computer Science 138, Springer-Verlag, 1982, pp. 292–308.

  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.

  12. Purdom, P.: Solving satisfiability problems with less searching,IEEE Transactions on Pattern Analysis and Machine Intelligence 6 (1084), 510–515.

    Google Scholar 

  13. Suchenek, M. A.: Minimal models for closed world databases, in Z. W. Ras (ed.),Proc. of ISMIS 4, Elsevier, 1989, pp. 515–522.

  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.

  15. Yahya, A. and Henschen, L.: Deduction in non-horn databases,J. Automated Reasoning 1(2) (1985), 141–160.

    Google Scholar 

  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.

Download references

Author information

Author notes

  1. José Alberto Fernández

    Present address: Bull HN Informations Systems Inc., 13430 N. Black Canyon Hwy., MS:AZ05/Z74, 85029-1310, Phoenix, AZ

Authors and Affiliations

  1. Electrical Engineering Department, Birzeit University, Birzeit, West Bank

    Adnan Yahya

  2. Computer Science Department, University of Maryland, 20742, College Park, MD, USA

    José Alberto Fernández & Jack Minker

Authors
  1. Adnan Yahya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Alberto Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Science Foundation, under the grant Nr. IRI-89-16059, the Air Force Office of Scientific Research, under the grant Nr. AFOSR-91-0350, and the Fulbright Scholar Program.

This work was done while visiting at the University of Maryland Institute for Advanced Computer Studies.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yahya, A., Fernández, J.A. & Minker, J. Ordered model trees: A normal form for disjunctive deductive databases. J Autom Reasoning 13, 117–143 (1994). https://doi.org/10.1007/BF00881914

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881914

Key words

Search

Navigation