Skip to main content
SpringerLink
Log in

An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

We present a simple and intuitive extension GCWAG of the generalized closed world assumption (GCWA) from positive disjunctive deductive databases to general disjunctive deductive databases (with default negation). This semantics is defined in terms of unfounded sets and possesses an argumentation-theoretic characterization. We also provide a top-down procedure for GCWAG, which is sound and complete with respect to GCWAG. We investigate two query evaluation methods for GCWAG: database partition, and database splitting. The basic idea of these methods is to divide the original deductive database into several smaller sub-databases and the query evaluation in the original database is transformed into the problem of query evaluation in smaller or simplified components. We prove that these two methods of query evaluation are all sound with respect to GCWAG.

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

  • Apt, K., Blair, H., and Walker, A. (1988). Towards a Theory of Declarative Knowledge. In Foundations of Deductive Databases and Logic Programming (pp. 89-148).

  • Brass, S. and Dix, J. (1999). Semantics of Disjunctive Logic Programs Based on Partial Evaluation,Journal of Logic Programming, 38(3), 167-312.

    Google Scholar 

  • Baumgartner, P., Furbach, U., and Stolzenburg, F. (1997). Computing Answers with Model Elimination, Artificial Intelligence, 90(1-2), 135-176.

    Google Scholar 

  • Bondarenko, A., Dung, P. M., Kowalski, R., and Toni, F. (1997). An Abstract, Argumentation-theoretic Framework for Default Reasoning, Artificial Intelligence, 93(1-2), 63-101.

    Google Scholar 

  • Baral, C., Lobo, J., and Minker, J. (1990). Generalized Disjunctive Well-founded Semantics for Logic Programs: Declarative Semantics. In Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems, Knoxville, TN (pp. 465-473).

  • Dix, J. (1992). Classifying Semantics of Disjunctive Logic Programs (extended abstract). In Proc. Joint International Conference and Symposium on Logic Programming (pp. 798-812).

  • Dung, P. (1995). An Argumentation-theoretic Foundation for Logic Programming, J. Logic Programming, 24, 151-177.

    Google Scholar 

  • Eiter, T., Leone, N., and Sacca, D. (1997). On the Partial Semantics for Disjunctive Deductive Databases, Annals of Math. and AI., 19(1-2), 59-96.

    Google Scholar 

  • Eiter, T., Gottlob, G., and Mannila, H. (1997). Disjunctive Datalog, ACM Transaction on Database Systems, 22(3), 364-418.

    Google Scholar 

  • Fernandez, J. (1994). Disjunctive Deductive Databases, PhD Thesis, University of Maryland.

  • Gelfond, M. and Lifschitz, V. (1988). The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen (Eds.), Logic Programming: Proc. of the Fifth International Conference and Symposium (pp. 1070-1080).

  • Gelfond, M., Przymusinska, H., and Przymusinski, T. (1989). On the Relationship Between Circumscription and Negation as Failure, Artificial Intelligence, 38(1), 75-94.

    Google Scholar 

  • Hayes, P. (1971). Semantic Trees. PhD Thesis, Edinburgh University.

  • Kakas, A., Kowalski, R., and Toni, F. (1998). The Role of Abduction in Logic Programming. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5 (pp. 235-324). Oxford, UK: Oxford University Press.

    Google Scholar 

  • Karacapilidis, N. and Papadias, D. (1998). A Computational Approach for Argumentative Discourse in Multi-agent Decision Making Environments, AI Communications, 11(1), 21-33.

    Google Scholar 

  • Kraus, S., Sycara, K., and Evenchik, A. (1998). Reaching Agreements through Argumentation: A logical Model and Implementation. Artificial Intelligence, 104, 1-69.

    Google Scholar 

  • Leone, N., Rullo, P., and Scarcello, F. (1997). Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation, Information and Computation, 135(2), 69-112.

    Google Scholar 

  • Lifschitz, V. (1985). Closed-world Data bases and Circumscription, Artificial Intelligence, 27(2), 229-235.

    Google Scholar 

  • Lifschitz, V. (1995). ECWA Made Easy, Annals of Mathematics and Artificial Intelligence, 14, 269-274.

    Google Scholar 

  • Lobo, J., Minker, J., and Rajasekar, A. (1992). Foundations of Disjunctive Logic Programming, Cambridge, MA: MIT Press.

    Google Scholar 

  • Lifschitz, V. and Turner, H. (1993). Splitting a Logic Program. In Proc. of International Conference on Logic Programming (pp. 567-585).

  • McCarthy, J. (1980). Circumscription—A form of Non-monotonic Reasoning, Artificial Intelligence, 13, 27-39.

    Google Scholar 

  • Minker, J. (1982). On Indefinite Databases and the Closed World Assumption. In LNCS 138, pp. 292-308.

  • Minker, J. and Rajasekar, A. (1990). A Fixpoint Semantics for Disjunctive Logic Programs, Journal of Logic Programming, 9(1), 45-74.

    Google Scholar 

  • Minker, J. and Zanon, G. (1982). An Extension to Linear Resolution with Selection Function, Information Processing Letters, 14(3), 191-194.

    Google Scholar 

  • Poole, D. (1989). What the Lottery Tells us About Default Reasoning. In Proc. of the 1st International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Canada (pp. 333-340).

  • Przymusinski, T. (1988). On the Declarative Semantics of Deductive Databases and Logic Programs. In Foundations of Deductive Databases and Logic Programming (pp. 193-216).

  • Przymusinski, T. (1991). Semantic of Disjuctive Logic Programs and Deductive Databases. In C. Delobel, M. Kifer, and Y. Masunaga (Eds.), Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD'91) (pp. 85-107). Germany: Springer Verlag.

    Google Scholar 

  • Przymusinski, T. (1991). Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401-424.

    Google Scholar 

  • Przymusinski, T. (1995). Static Semantics for Normal and Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 14, 323-357.

    Google Scholar 

  • Prakken, H. and Sartor, G. (1996). Special Issue on Logical Models of Argumentation, Artificial Intelligence and Law Journal, 4(3-4).

  • Rajasekar, A. and Minker, J. (1990). On Stratified Disjunctive Programs, Annals of Mathematics and Artificial Intelligence, 1(1-4), 339-357.

    Google Scholar 

  • Reiter, R. (1978). On the Closed World Databases. In H. Gallaire and J. Minke (Eds.), Logic and Data Bases. (pp. 119-140). New York: Plenum Press.

    Google Scholar 

  • Schlipf, J. (1992). Formalizing a Logic for Logic Programming, Annals of Mathematics and Artificial Intelligence, 5, 279-302.

    Google Scholar 

  • Sakama, C. and Inoue, K. (1993). Negation in Disjunctive Logic Programs. In Proceedings of the 10th International Conference on Logic Programming (ICLP'93) (pp. 703-719). Cambridge, MA: MIT Press.

    Google Scholar 

  • Van Gelder, A., Ross, K., and Schlipf, J. (1988). Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proceedings of the 7th ACM Symposium on Principles Of Database Systems. (pp. 221-230). Full version in J. ACM, 38, 620-650, 1992.

    Google Scholar 

  • Wang, K. (2000). Argumentation-based Abduction in Disjunctive Logic Programming, Journal of Logic Programming, 45(1-3), 105-140.

    Google Scholar 

  • Wang, K. and Chen, H. (1998). Abduction, Argumentation and Bi-disjunctive Logic Programs. In J. Dix, L. Pereira and T. Przymusinski (Eds.), Logic Programming and Knowledge Representation (LNAI 1471), Proc. LPKR'97 (pp. 139-163).

  • Yahya, A. and Minker, J. (1994). Query Evaluation in Partitioned Disjunctive Deductive Databases, International Journal of Intelligent and Cooperative Systems, 3(4), 385-413.

    Google Scholar 

  • You, J., Yuan, L., and Gobel, R. (2000). Abductive Logic Programming with Disjunctive Logic Programs, Journal of Logic Programming, 44(1-3), 101-127.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China; Institut für Informatik, Universität Potsdam, Germany

    Kewen Wang

  2. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, People's Republic of China

    Lizhu Zhou

Authors
  1. Kewen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lizhu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kewen Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, K., Zhou, L. An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases. Journal of Intelligent Information Systems 16, 229–253 (2001). https://doi.org/10.1023/A:1011271902410

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011271902410

Search

Navigation