Skip to main content
SpringerLink
Log in

Model-theoretic minimal change operators for constraint databases

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover Database Theory — ICDT '97 (ICDT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1186))

Included in the following conference series:

Abstract

Database systems should allow users to insert new information (described by a first-order sentence) into a database without specifying exactly how. The database systems should be able to figure out what tuples to add or delete from the current database to satisfy fully the user's request. The guiding principle of accomplishing such insertions is the concept of model-theoretic minimal change. This paper shows that this concept can be applied to constraint databases. In particular, any constraint database change operator that satisfies the axioms for revision [AGM85], update [KM92], or arbitration [Rev96] accomplishes a model-theoretic minimal change in a well-defined sense. The paper also presents concrete operators for revision, update, and arbitration for constraint databases with real polynomial inequality constraints.

This work was supported by NSF grants IRI-9625055 and IRI-9632871.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. E. Alchourrón, P. Gärdenfors & D. Makinson. On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic, (50), pages 510–530, 1985.

    Google Scholar 

  2. C. Baral, S. Kraus, J. Minker & V.S. Subrahmanian. Combining knowledge bases consisting of first-order theories. Computational Intelligence, vol. 8, no. 1, pages 45–71, 1992.

    Google Scholar 

  3. A. Benczur, A.B. Novak, & P.Z. Revesz. On Weighted Knowledgebase Transformations. Proc. Fourth Symposium on Programming Languages and Software Tools, pp. 404–415, Visegrad, Hungary, June 1995.

    Google Scholar 

  4. S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, & J. Widom. The TSIMMIS Project: Integration of Heterogeneous Information Sources, Proc. IPSJ Conf., Tokyo, Japan, Oct 1994.

    Google Scholar 

  5. J. Chomicki & G. Kuper. Measuring Infinite Relations. Fourteenth ACM Symposium on Principles of Database Systems, pages 246–260, 1995.

    Google Scholar 

  6. E.R. Dougherty. An Introduction to Morphological Image Processing. SPIE Press, 1992.

    Google Scholar 

  7. R. Fagin, G. Kuper, J. D. Ullman & M. Y. Vardi. Updating logical databases. In: Advances in Computing Research, Vol. 3, P. C. Kanellakis and F. Preparata eds., pages 1–18, JAI Press, 1986.

    Google Scholar 

  8. C. Faloutsos & I. Kamel. Beyond Uniformity and Independence: Analysis of R-tree Using the Concept of Fractal Dimension. Proc. 13th ACM Symposium on Principles of Database Systems, pages 4–13, 1994.

    Google Scholar 

  9. G. Grahne, A. O. Mendelzon, & P. Z. Revesz. Knowledgebase transformations. Journal of Computer and System Sciences, to appear. (Preliminary version in Proc. 11th ACM PODS, 1992.)

    Google Scholar 

  10. H. V. Jagadish. A retrieval technique for similar shapes. ACM SIGMOD Symposium on the Management of Data, pages 208–217, 1991.

    Google Scholar 

  11. P. C. Kanellakis, G. M. Kuper, & P. Z. Revesz. Constraint Query Languages, Journal of Computer and System Sciences, vol. 51, pages 26–52, 1995. (Preliminary version in Proc. 9th ACM PODS, 1990).

    Google Scholar 

  12. H. Katsuno & A. O. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52, pages 263–294, 1991.

    Google Scholar 

  13. H. Katsuno & A. O. Mendelzon. On the difference between updating a knowledge base and revising it. In: Belief Revision, Gärdenfors, ed., pages 183–203, Cambridge University Press, 1992.

    Google Scholar 

  14. G. Kuper. Aggregation in constraint databases. First Workshop on Principles and Practice of Constraint Programming, p. 176–183, 1993.

    Google Scholar 

  15. P. Liberatore & M. Schaerf. Arbitration: A commutative operator for belief revision. World Conference on the Fundamentals of Artificial Intelligence, 1995.

    Google Scholar 

  16. P. Z. Revesz. On the semantics of arbitration. International Journal of Algebra and Computation, to appear. (Preliminary version in Proc. 12th ACM PODS, 1993.)

    Google Scholar 

  17. V.S. Subrahmanian. Amalgamating Knowledge bases. ACM Transactions on Database Systems, Vol 19, no. 2, p. 291–331, 1994.

    Google Scholar 

  18. G. Wiederhold. Mediators in the Architecture of Future Information Systems. IEEE Computers, Vol. 25, p. 38–49, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nebraska, 68588, Lincoln, NE

    Peter Z. Revesz

Authors
  1. Peter Z. Revesz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Foto Afrati Phokion Kolaitis

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Revesz, P.Z. (1996). Model-theoretic minimal change operators for constraint databases. In: Afrati, F., Kolaitis, P. (eds) Database Theory — ICDT '97. ICDT 1997. Lecture Notes in Computer Science, vol 1186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62222-5_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-62222-5_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62222-2

  • Online ISBN: 978-3-540-49682-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation