Skip to main content
SpringerLink
Log in

On Complexity of Updates through Integrity Constraints

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

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

Included in the following conference series:

Abstract

The computational complexity is explored of finding the minimal real change of a database after an update constrained by a logic program. A polynomial time algorithm is discovered which solves this problem for ground IC in partial interpretations. Formulated in a “property” form, even under the premise of fixed database scheme, this problem turns out to be complete in the first three classes of ∑ and ∏ polynomial hierarchies, depending on many factors: type of interpretation (total or partial), presence of variables, use of negation, arity of predicates, etc. Meanwhile, we show that under strong restrictions to negative constraints the problem is solvable in polynomial time. If the database scheme may vary, the complexity grows exponentially.

This work was sponsored by the Russian Fundamental Studies Foundation (Grants 98-01-00204, 99-01-00374, 00-01-00254).

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S.: Updates a new Frontier. In: Proc. of the Second International Conference on the Theory of Databases, ICDT’88. LNCS 326 (1988) 1–18.

    Google Scholar 

  2. Abiteboul, S., Vianu, V.: Datalog Extensions for Database Queries and Updates. JCSS, 43, n. 1 (1991) 62–124.

    MATH  MathSciNet  Google Scholar 

  3. Alchourón, C.E., Gärdenfors, P., and Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic. 50 (1985) 510–530.

    Article  MathSciNet  Google Scholar 

  4. Alferes, J.J., Pereira, L.M.: Update-Programs Can Update Programs. In J. Dix, L.M. Pereira, T.C. Przymusinski, editors: Second International Workshop, NMELP’96. Selected Papers. LNCS 1216 (1997) 110–131.

    Google Scholar 

  5. Baral, C., Lobo, J.: Formal Characterization of Active Databases. In Pedreschi, D., Zaniolo, C., editors: Logic in Databases. Intern. Workshop LID’96. Proceedings. San Milano, Italy. (1996), 175–195.

    Google Scholar 

  6. Baralis E., Ceri S., Paraboschi S.: Improved rule analysis by means of triggering and activation graphs. In T. Sellis, editor: Rules in Database Systems, LNCS 985 (1995) 165–181.

    Google Scholar 

  7. Chandra A., Merlin P.: Optimal implementation of conjunctive queries in relational databases. In: Ninth ACM Symp. on Theory of Computing. (1977) 77–90.

    Google Scholar 

  8. Dantsin, E., Eiter, T. Gottlob, G., Voronkov, A.: Complexity and Expressiveness of Logic Programming. In: Proc. 12th Annual IEEE Conf. On Comput. Compl. (1997), 82–101.

    Google Scholar 

  9. Dayal, U., Hanson, E., and Widom, J.: Active database systems. In: W. Kim, editor, Modern Database Systems. Addison Wesley (1995) 436–456

    Google Scholar 

  10. Decker H.: An extension of SLD by abduction and integrity maintenance for view updating in deductive databases. In: Proc. of the 1996 International Conference on Logic Programming. MIT Press, (1996), 157–169.

    Google Scholar 

  11. Dekhtyar, M., Dikovsky, A., Spyratos, N.: On Conservative Enforced Updates. In: Dix, J., Furbach, U., Nerode, A., editors: Proceedings of 4th International Conference, LPNMR’97. Dagstuhl Castle, Germany, LNCS 1265 (1997) 244–257.

    Google Scholar 

  12. Dekhtyar, M., Dikovsky, A., Spyratos, N.: On Logically Justified Updates. In: J. Jaffar, editor: Proc. of the 1998 Joint International Conference and Symposium on Logic Programming. MIT Press, (1998), 250–264.

    Google Scholar 

  13. Dekhtyar, M., Dikovsky, A., Dudakov, S., Spyratos, N.: Monotone Expansion of Updates in Logical Databases. In: Proc. of 5th International Conference LPNMR’ 99. LNAI 1730 (1999) 132–147.

    Google Scholar 

  14. Dekhtyar, M., Dikovsky, A., Dudakov, S., Spyratos, N.: Maximal Expansions of Database Updates. In Foundations of Information and Knowledge Systems, FoIKS 2000. LNCS 1762 (2000) 72–87.

    Chapter  Google Scholar 

  15. Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence 57 (1992) 227–270.

    Article  MathSciNet  MATH  Google Scholar 

  16. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Transactions on Database Systems 22(3) 364–418.

    Google Scholar 

  17. Immerman, N.: Relational queries computable in polynomial time. Information and Conyrol 68 (1986) 86–104.

    Article  MATH  MathSciNet  Google Scholar 

  18. Gottlob, G., Moerkotte, G., Subrahmanian, V.S.: The PARK semantics for active databases. In: Proceedings of EDBT’96. Avignon, France (1996).

    Google Scholar 

  19. Guessoum A., Lloyd J.W.: Updating knowledge bases. New Generation Computing, 8 (1990), 71–89.

    Article  MATH  Google Scholar 

  20. Halfeld Ferrari Alves, M., Laurent, D., Spyratos, N., Stamate, D.: Update rules and revision programs. Rapport de Recherche Université de Paris-Sud, Centre d’Orsay, LRI 1010 (12 / 1995).

    Google Scholar 

  21. Kakas A.C., Mancarella P.: Database updates through abduction. IN: Proc. 16th VLBD Conference. (1990) 650–661.

    Google Scholar 

  22. Katsuno, H., Mendelzon, A. O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52 (1991) 253–294.

    Article  MathSciNet  Google Scholar 

  23. Lloyd, J.W., Foundations of Logic Programming. Second, Extended Edition. Springer-Verlag. (1993)

    Google Scholar 

  24. Marek, V.W., Truszczyński, M.: Revision programming, database updates and integrity constraints. In: International Conference on Data Base theory, ICDT. LNCS 893 (1995) 368–382.

    Google Scholar 

  25. Picouet, Ph., Vianu, V.: Expressiveness and Complexity of Active Databases. In: Afrati, F., Kolaitis, Ph., editors, 6th Int. Conf. on Database Theory, ICDT’97. LNCS 1186 (1997) 155–172.

    Google Scholar 

  26. Przymusinski, T.C., Turner, H.: Update by Means of Inference Rules. In: V.W. Marek, A. Nerode, M. Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning. Proc. of the Third Int. Conf. LPNMR’95, Lexington, KY, USA (1995) 166–174.

    Google Scholar 

  27. Raschid, L., Lobo, J.: Semantics for Update Rule Programs and Implementation in a Relational Database Management System. ACM Trans. on Database Systems 21 (December 1996) 526–571

    Google Scholar 

  28. Schewe, K.-D., Thalheim, B.: Consistency Enforcement in Active Databases. In: Chakravarty, S., Widom, L., editors: Research Issues in Data Engineering-Active Databases. Proceedings. Houston, (1994).

    Google Scholar 

  29. Vardi, M.: The complexity of relational query languages. In: ACM Symposium on Theory of Computing (STOC), San Francisco, (1982) 137–146.

    Google Scholar 

  30. Winslet M.: Reasoning about action using a possible models approach. In: Proc. AAAI’88, v. 1 (1988) 89–93.

    Google Scholar 

  31. Zaniolo, C.: Active database rules with transaction-conscious stable-model semantics. In: Proceedings of Fourth International Conference, DOOD’95. LNCS 1013 (1995) 55–72

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of CS, Tver State Univ., 33 Zheljabova str., Tver, Russia, 170000

    Michael Dekhtyar & Sergey Dudakov

  2. IRIN, UPREF EA No 2157, Université de Nantes, 2, rue de la Houssinière, BP 92208, F 44322, Nantes cedex 3, France

    Alexander Dikovsky

Authors
  1. Michael Dekhtyar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Dikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergey Dudakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dekhtyar, M., Dikovsky, A., Dudakov, S. (2000). On Complexity of Updates through Integrity Constraints. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation