Skip to main content
SpringerLink
Log in

Complexity of the Stable Model Semantics for Queries on Incomplete Databases

  • Conference paper
Book cover Logic Programming and Nonmonotonic Reasoning (LPNMR 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5753))

  • 820 Accesses

Abstract

We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closed- and open-world interpretation of C-databases with and without conditions. By reduction to stable models of logic programs we find that, under closed-world interpretation, adding negation to (disjunctive) Datalog does not increase the complexity of the considered problems for C-databases, but certain answers for databases without conditions are easier for Datalog without than with negation. Under open-world interpretation, adding negation to non-recursive Datalog already leads to undecidability, but the complexity of certain answers for negation-free queries is the same as under closed-world interpretation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: Proc. PODS, pp. 254–263 (1998)

    Google Scholar 

  2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  3. Abiteboul, S., Kanellakis, P.C., Grahne, G.: On the representation and querying of sets of possible worlds. Theoretical Computer Science 78(1), 158–187 (1991)

    MathSciNet  MATH  Google Scholar 

  4. Bertossi, L.E., Bravo, L.: Consistent query answers in virtual data integration systems. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 42–83. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Codd, E.F.: Extending the database relational model to capture more meaning. ACM ToDS 4(4), 397–434 (1979)

    Article  Google Scholar 

  6. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33(3), 374–425 (2001)

    Article  Google Scholar 

  7. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM ToDS 22(3), 364–418 (1997)

    Article  Google Scholar 

  8. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)

    Article  MATH  Google Scholar 

  10. Gelfond, M., Przymusinska, H.: Reasoning on open domains. In: Proc. LPNMR, pp. 397–413 (1993)

    Google Scholar 

  11. Grahne, G.: Horn tables - an efficient tool for handling incomplete information in databases. In: Proc. PODS, pp. 75–82 (1989)

    Google Scholar 

  12. Halevy, A.Y.: Answering queries using views: A survey. VLDB J. 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  13. Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming with guarded programs. ACM ToCL 9(4) (2008)

    Google Scholar 

  14. Imieliński, T., Lipski, W.: Incomplete information in relational databases. Journal of the ACM 31(4), 761–791 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Imieliński, T., Naqvi, S.A., Vadaparty, K.V.: Incomplete objects - a data model for design and planning applications. In: Proc. SIGMOD, pp. 288–297 (1991)

    Google Scholar 

  16. Lenzerini, M.: Data integration: A theoretical perspective. In: PODS, pp. 233–246 (2002)

    Google Scholar 

  17. Libkin, L.: Data exchange and incomplete information. In: Proc. PODS, pp. 60–69 (2006)

    Google Scholar 

  18. Reiter, R.: A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of the ACM 33(2), 349–370 (1986)

    Article  MathSciNet  Google Scholar 

  19. Rosati, R.: On the decidability and finite controllability of query processing in databases with incomplete information. In: Proc. PODS, pp. 356–365 (2006)

    Google Scholar 

  20. Schlipf, J.: Some Remarks on Computability and Open Domain Semantics. In: Proc. WS on Structural Complexity and Recursion-Theoretic Methods in Logic Programming (1993)

    Google Scholar 

  21. Schlipf, J.: Complexity and Undecidability Results for Logic Programming. Annals of Mathematics and Artificial Intelligence 15(3-4), 257–288 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Trakhtenbrot, B.: Impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSSR 70, 569–572 (1950)

    MATH  Google Scholar 

  23. Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: ACM Symposium on Theory of Computing, pp. 137–146 (1982)

    Google Scholar 

  24. Vardi, M.Y.: On the integrity of databases with incomplete information. In: Proc. PODS, pp. 252–266 (1986)

    Google Scholar 

  25. Vardi, M.Y.: Querying logical databases. Journal of Computer and System Sciences 33(2), 142–160 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Vorobyov, S.G., Voronkov, A.: Complexity of nonrecursive logic programs with complex values. In: PODS, pp. 244–253 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KRDB Research Center, Free University of Bozen-Bolzano, Italy

    Jos de Bruijn

  2. Institute of Information Systems, Vienna University of Technology, Austria

    Stijn Heymans

Authors
  1. Jos de Bruijn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stijn Heymans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Natural Sciences, Sabanci University, Orhanli, Tuzla, 34956, Istanbul, Turkey

    Esra Erdem

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay,, Hong Kong

    Fangzhen Lin

  3. Institut für Informatik, Universität Potsdam, August-Bebel-Str. 89, D-14482, Potsdam, Germany

    Torsten Schaub

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Bruijn, J., Heymans, S. (2009). Complexity of the Stable Model Semantics for Queries on Incomplete Databases. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04238-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04237-9

  • Online ISBN: 978-3-642-04238-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation