Skip to main content
SpringerLink
Log in

On the partial semantics for disjunctive deductive databases

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Partial stable models for deductive databases, i.e., normal function-free logic programs (also called datalog programs), have two equivalent definitions: one based on 3-valued logics and another based on the notion of unfounded set. The notion of partial stable model has been extended to disjunctive deductive databases using 3-valued logics. In this paper, a characterization of partial stable models for disjunctive datalog programs is given using a suitable extension of the notion of unfounded set. Two interesting sub-classes of partial stable models, M-stable (Maximal-stable) (also called regular models, preferred extension,and maximal stable classes) and L-stable (Least undefined-stable) models, are then extended from normal to disjunctive datalog programs. On the one hand, L-stable models are shown to be the natural relaxation of the notion of total stable model; on the other hand the less strict M-stable models, endowed with a nice modularity property, may be appealing from the programming and computational point of view. M-stable and L-stable models are also compared with the regular models for disjunctive datalog programs recently proposed in the literature.

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. M. Ahlsen et al., The KIWIS knowledge base management system, in: Advanced Information Systems Engineering: Proc. Third Intl Conf. (CAiSE'91), Trondheim, Norway, eds. J.A. Bubenko, Jr. and A. Solvberg, LNCS 498 (Springer, 1991) pp. 79–97.

  2. K.R. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufman, Washington DC, 1988) 89–148.

    Google Scholar 

  3. Ch. Baral, Generalized negation as failure and semanties of normal disjunctive logic programs, in: Proc. Intl Conf. on Logic Programming and Automated Reasoning (LPAR '92), St. Petersburg, ed. A. Voronkov, LNCS 624 (Springer, 1992) pp. 309–319.

  4. Ch. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logic, Journal of Automated Reasoning 8 (1992) 345–366.

    Google Scholar 

  5. Ch. Baral and V.S. Subrahmanian, Dualities between alternative semantics for logic programming and non-monotonic reasoning, Journal of Automated Reasoning 10 (1993) 399–420.

    Google Scholar 

  6. S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases (Springer, Berlin, 1990).

    Google Scholar 

  7. J. Dix, Semantics of logic programs: their intuition and formal properties. An overview, in: Logic, Action and Information, Proceedings of the Konstanz Colloquium in Logic and Information, eds. A. Fuhrmann and H. Rott (deGruyter, Berlin, 1995) pp. 241–329.

    Google Scholar 

  8. J. Dix, Classifying semantics of disjunctive logic programs, in: Logic Programming: Proc. 1992 Intl Joint Conference and Symposium (IJCSLP '92), ed. K. Apt (MIT Press, 1992) pp. 798–812.

  9. J. Doyle, A truth maintenance system, Artificial Intelligence 12 (1979) 231–272.

    Google Scholar 

  10. Ph. Dung, Negation as hypotheses: an abductive foundation for logic programming, in: Logic Programming: Proc. 8th Intl Conference, ed. K. Furukawa (MIT Press, 1991) pp. 3–17.

  11. T. Eiter, N. Leone and D. Saccà, The expressive power of partial models for disjunctive deductive databases, in: Proceedings of International Workshop on Logic in Databases (LID '96), San Miniato, Pisa, Italy (1996) pp. 261–280.

  12. T. Eiter, G. Gottlob and H. Mannila, Adding disjunction to datalog, in: Proc. Thirteenth ACM Symposium on Principles of Database Systems (PODS '94), Minneapolis, Minnesota, USA (ACM, 1994) pp. 267–278. Full paper CD-TR 96/90, Christian Doppler Lab. for Expert Systems, TU Vienna, Vienna, 1996.

  13. T. Eiter and G. Gottlob, On the computational cost of disjunctive logic programming: Propositional case, Ann. of Math. and AI 15 (1995) 289–323.

    Google Scholar 

  14. G. Gottlob, N. Leone and H. Veith, Second order logic and the weak exponential hierarchies, in: Proc. Conference on Mathematical Foundations of Computer Science (MFCS '95), Prague, eds. J. Wiedermann and P. Hajek, LNCS 969 (Springer, 1995) pp. 66–81. Full paper CD-TR 95/80, Christian Doppler Lab. for Expert Systems, TU Vienna, Vienna (1995).

  15. S. Greco, N. Leone and P. Rullo, COMPLEX: An object-oriented logic programming system, IEEE Transactions on Knowledge and Data Engineering 4(4) (1992) 344–359.

    Google Scholar 

  16. M. Fitting, A Kripke-Kleene semantics for logic programs, Journal of Logic Programming 2(4) (1985) 295–312.

    Google Scholar 

  17. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proceedings Fifth Intl Conference and Symposium, Washington, Seattle, USA (MIT Press, 1988) pp. 1070–1080.

  18. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991) 365–385.

    Google Scholar 

  19. A. Kakas and P. Mancarella, Preferred extensions are partial stable models, Journal of Logic Programming 14 (1992) 341–348.

    Google Scholar 

  20. J.A. Fernández and J. Minker, Semantics of disjunctive deductive databases, in: Proc. 4th Intl Conference on Database Theory (ICDT '92), eds. J. Biskup et al., LNCS 646 (Springer, 1992) pp. 21–50.

  21. KIWI Team, A system for managing data and knowledge bases, in: Proc. ESPRIT Technical Week 1988: ESPRIT Project 1117 (North-Holland, 1988).

  22. N. Leone, P. Rullo and F. Scarcello, Declarative and fixpoint characterizations of disjunctive stable models, in: Logic Programming: Proc. Twelth Intl Symposium (ILPS '95), Portland, Oregon, USA, ed. J. Lloyd (MIT Press, 1995) pp. 399–413.

  23. N. Leone, P. Rullo, A. Mecchia and G. Rossi, A deductive environment for dealing with objects and non-monotonic reasoning, IEEE Transactions on Knowledge and Data Engineering (1997), forthcoming.

  24. V. Lifschitz and H. Turner, Splitting a logic program, in: Logic Programming: Proc. Eleventh Intl Conference, Santa Margherita Ligure, Italy, ed. P. van Hentenryck (MIT Press, 1994) pp. 23–38.

  25. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, 1992).

  26. J. Minker, On indefinite databases and the closed world assumption, in: Proc. 6th Conference on Automated Deduction (CADE '82), New York, ed. D.W. Loveland, LNCS 138 (Springer, 1982) pp. 292–308.

  27. J. Minker, Overview of disjunctive logic programming, Ann. of Math. and AI 12 (1994) 1–24.

    Google Scholar 

  28. T. Przymusinski, On the declarative and procedural semantics of stratified deductive databases, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufman, Washington DC, 1988) pp. 193–216.

    Google Scholar 

  29. T. Przymusinski, Stationary semantics for disjunctive logic programs and deductive databases, in: Logic Programming: Proc. 1990 North American Conference, ed. S. Debray (MIT Press, 1990) pp. 40–62.

  30. T. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing 9 (1991) 401–424.

    Google Scholar 

  31. R. Reiter, On closed-world databases, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, New York, 1978) pp. 55–76.

    Google Scholar 

  32. K. Ross, The well-founded semantics for disjunctive logic programs, in: Deductive and Object-Oriented Databases: Proc. First Intl Conference (DOOD '89), Kyoto Research Park, Kyoto, Japan, eds. W. Kim, J.-M. Nicolas and S. Nishio (Elsevier, 1990) pp. 385–402.

  33. K. Ross, Modular stratification and magic sets for Datalog programs with negation, Journal of the ACM 41(6) (1994) 1216–1267.

    Google Scholar 

  34. D. Saccà and C. Zaniolo, Stable models and nondeterminism in logic programs with negation, in: Proc. Ninth ACM Symposium on Principles of Database Systems (PODS '90), Nashville, Tennessee, USA (ACM, 1990) pp. 205–218.

  35. D. Saccà and C. Zaniolo, Partial models and three-valued models in logic programs with negation, in: Proc. 1st Intl Workshop on Logic Programming and Nonmonotonic Reasoning, Washington DC, eds. A. Nerode, W. Marek and V.S. Subrahmanian (MIT Press, 1991) pp. 87–104.

  36. D. Saccà, The expressive powers of stable models for bound and unbound queries, Journal of Computer and System Sciences, forthcoming. (Extended abstract in: Proc. 2nd Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Vancouver, Canada, eds. H. Blair, W. Marek and A. Nerode (MSI, Cornell University, 1993).

  37. D. Saccà and C. Zaniolo, Deterministic and non-deterministic stable models, Journal of Logic and Computation (1997), forthcoming.

  38. J.S. Schlipf, The expressive powers of logic programming semantics, Journal of Computer and System Sciences 51(1) (1995) 64–86.

    Google Scholar 

  39. J.D. Ullman, Principles of Database and Knowledge-Base Systems (Computer Science Press, Rockville, Maryland, USA, 1989).

    Google Scholar 

  40. A. Van Gelder, The alternating fixpoint of logic programs with negation, in: Proc. Eighth ACM Symposium on Principles of Database Systems (PODS '89), Philadelphia, Pennsylvania, USA (ACM, 1989) pp. 1–10.

  41. A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620–650.

    Google Scholar 

  42. J. You and L.Y. Yuan, Three-valued formalization of logic programming: is it needed? in: Proc. Ninth ACM Symposium on Principles of Database Systems (PODS '90), Nashville, Tennessee, USA (ACM, 1990) pp. 172–182.

  43. J. You and L.Y. Yuan, A three-valued semantics for deductive databases and logic programs, Journal of Computer and System Sciences 49 (1994) 334–361.

    Google Scholar 

  44. J. You and L.Y. Yuan, On the equivalence of semantics for normal logic programs, Journal of Logic Programming 22(3) (1995) 211–222.

    Google Scholar 

Download references

Authors
  1. Thomas Eiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicola Leone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eiter, T., Leone, N. & Saccà, D. On the partial semantics for disjunctive deductive databases. Annals of Mathematics and Artificial Intelligence 19, 59–96 (1997). https://doi.org/10.1023/A:1018947420290

Download citation

  • Issue Date:

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

Keywords

Search

Navigation