Skip to main content

A Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4690))

Abstract

In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based on hyperresolution is introduced which extends Minker’s operator for positive disjunctive Datalog rules. In contrast to already existing model generation methods our approach for efficiently computing perfect models is based on state generation. Additionally, it enhances model state computation based on Minker’s operator for positive disjunctive Datalog rules.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Blair, H.A., Walker, A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming. ch. 2, pp. 89–148. Morgan Kaufmann Publishers, San Francisco (1988)

    Google Scholar 

  2. Apt, K.R.: Logic Programming. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 493–574. The MIT Press, Cambridge (1990)

    Google Scholar 

  3. Chan, E.P.F.: A Possible World Semantics for Disjunctive Databases. IEEE Transactions on Knowledge and Data Engineering 5(2), 282–292 (1993)

    Article  Google Scholar 

  4. Behrend, A.: A Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases. Technical Report IAI-TR-2006-7, Institut für Informatik III, Universität Bonn (December 2006)

    Google Scholar 

  5. Baral, C., Lobo, J., Minker, J.: Generalized Well-founded Semantics for Logic Programs (Extended Abstract). In: Stickel, M.E. (ed.) 10th International Conference on Automated Deduction. LNCS, vol. 449, pp. 102–116. Springer, Heidelberg (1990)

    Google Scholar 

  6. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  7. Eiter, T., Gottlob, G., Mannila, H.: Adding Disjunction to Datalog. In: PODS 1994, pp. 267–278 (1994)

    Google Scholar 

  8. Fernández, J.A., Minker, J.: Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases. In: ICLP 1991, pp. 660–675 (1991)

    Google Scholar 

  9. Fernández, J.A., Minker, J.: Bottom-Up Compuation of Perfect Models for Disjunctive Theories. Journal of Logic Programming 25(1), 33–51 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sakama, C., Inoue, K.: Updating Extended Logic Programs through Abduction. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 147–161. Springer, Heidelberg (1999)

    Google Scholar 

  11. Lobo, J., Minker, J., Rajasekar, A.: Extending the Semantics of Logic Programs to Disjunctive Logic Programs. In: ICLP 1989, pp. 255–267 (1989)

    Google Scholar 

  12. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, Massachusetts (1992)

    Google Scholar 

  13. Minker, J.: On Indefinite Databases and the Closed World Assumption. In: Loveland, D.W. (ed.) 6th Conference on Automated Deduction. LNCS, vol. 138, pp. 292–308. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  14. Minker, J., Rajasekar, A.: A Fixpoint Semantics for Disjunctive Logic Programs. Journal of Logic Programming 9(1), 45–74 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  15. Przymusinski, T.C.: On the Declarative Semantics of Deductive Databases and Logic Programs. In: Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  16. Przymusinski, T.C.: Stable Semantics for Disjunctive Programs. New Generation Computing 9(3/4), 401–424 (1991)

    Article  Google Scholar 

  17. Robinson, J.: Automated Deduction with Hyper-Resolution. International Journal of Computer Mathematics 1, 227–234 (1965)

    MATH  Google Scholar 

  18. Sakama, C.: Possible Model Semantics for Disjunctive Databases. In: DOOD 1989, pp. 369–383 (1989)

    Google Scholar 

  19. Sarma, A.D., Benjelloun, O., Halevy, A., Widom, J.: Working Models for Uncertain Data. In: ICDE 2006 (2006)

    Google Scholar 

  20. Seipel, D., Minker, J., Ruiz, C.: Model Generation and State Generation for Disjunctive Logic Programs. Journal of Logic Programming 32(1), 49–69 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  21. Seipel, D., Thöne, H.: DISLOG - A System for Reasoning in Disjunctive Deductive Databases. In: DAISD 1994, pp. 325–343 (1994)

    Google Scholar 

  22. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Yannis Ioannidis Boris Novikov Boris Rachev

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behrend, A. (2007). A Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds) Advances in Databases and Information Systems. ADBIS 2007. Lecture Notes in Computer Science, vol 4690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75185-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75185-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75184-7

  • Online ISBN: 978-3-540-75185-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics