Skip to main content
SpringerLink
Log in

Incremental models of updating data bases

  • Conference paper
  • First Online:
Algebraic Logic and Universal Algebra in Computer Science (ALUACS 1988)

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

Abstract

This paper introduces a generalization of weak model-theoretic forcing of [Rob71] and [Kei73]. This generalized forcing preserves classic properties of weak model-theoretic forcing, e.g. Generic Set Theorem (Thm. 3.23), Generic Model Theorem (Thm. 3.24, Thm. 4.8), and Henrard's Theorem (Thm. 5.8). It is applied in this paper to investigate a deductive model for updating a deductive data base with incomplete information, whose possible variations are restricted to certain finite sets of atomic or negated atomic first-order sentences. Moreover, the paper introduces the notion of pragmatic truth pertinent to those models, and characterizes it in terms of generalized forcing (Thm. 5.11).

In conclusion, the paper offers (Thm. 8.4) two semantic and two syntactic characterizations of the ∀-fragment of minimal entailment.

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. Jon Barwise, editor. Handbook of Mathematical Logic. North-Holland, Amsterdam, second edition, 1978.

    Google Scholar 

  2. N. Bidoit and R. Hull. Positivism vs. minimalism in deductive databases. In A. Silberschatz, editor, Proceedings of 5-th Symposium on Principles of Database Systems, pages 123–132, A.C.M. SIGACT-SIGMOD, Association for Computing Machinery, New York, 1986.

    Google Scholar 

  3. Genviéve Bossu and Pierre Siegel. Saturation, nonmonotonic reasoning, and the closed world assumption. Artificial Intelligence, 25(1):13–64, 1984.

    Article  MathSciNet  Google Scholar 

  4. David W. Etherington, Robert Mercer, and Raymond Reiter. On the adequacy of predicate circumscription for closed-world reasoning. Computational Intelligence, 1:11–15, 1985.

    Google Scholar 

  5. Paul Henrard. Le ‘forcing-compagnon’ sans ‘forcing'. C. R. Acad. Sc., 276(Ser. A):821–822, 1973.

    MATH  MathSciNet  Google Scholar 

  6. Jaakko Hintikka. Model minimization — an alternative to circumscription. Journal of Automated Reasoning, 4:1–13, 1988.

    Article  MathSciNet  Google Scholar 

  7. Kurt Kaiser. Über eine verallgemeinerung der Robinsonschen Modellvervollstaändigung. Zeitschrift für Mathematik Logik und Grundlagen der Mathematik, 15:37–48, 1969.

    MATH  MathSciNet  Google Scholar 

  8. H. Jerome Keisler. Forcing and the omitting types theorem. In M. Morley, editor, Studies in Model Theory, pages 96–133, Mathematical Association of America, 1973.

    Google Scholar 

  9. Roger C. Lyndon. Properties preserved under homomorphism. Pacific J. Math., 9:143–154, 1959.

    MATH  MathSciNet  Google Scholar 

  10. Jack Minker. On indefinite databases and closed world assumption. In Proceedings of Sixth Conference on Automated Deduction, pages 292–308, Springer Verlag, Berlin, New York, 1982.

    Chapter  Google Scholar 

  11. Raymond Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, pages 55–76, Plenum Press, 1978.

    Google Scholar 

  12. Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  13. Abraham Robinson. Forcing in model theory. In Proc. Simp. Mat., pages 64–80, Institute Nationale di Alta Matematica, 1971.

    Google Scholar 

  14. John C. Shepherdson. Negation in logic programming. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publ., Inc., Los Altos, 1988.

    Google Scholar 

  15. Marek A. Suchenek and James H. Thomas. Forcings and homomorphisms in deductive data bases. Submitted.

    Google Scholar 

  16. Marek A. Suchenek. Forcing treatment of incomplete information in data bases. In International Symposium on Model Theory in Foundations of Computer Science, Budapest, September 1984.

    Google Scholar 

  17. Marek A. Suchenek. On asymptotic decidability of modeltheoretic forcing. Research Reports 63/85, Institute of Computer Science, Warsaw Technical University, Nowowiejska 15/19, 00-665 Warszawa, Poland, 1985.

    Google Scholar 

  18. Marek A. Suchenek. Non-monotonic derivations which preserve pragmatic truth. In Maria Zemankova and M. L. Emrich, editors, Proceedings of the International Symposium on Methodologies for Intelligent Systems, Colloquia Program, ORNL-6362, pages 69–74, Oak Ridge National Laboratory, Knoxville, October 1986.

    Google Scholar 

  19. Marek. A. Suchenek. Forcing versus closed world assumption. In Zbigniew W. Raś and Maria Zemankova, editors, Methodologies for Intelligent Systems, pages 453–460, North-Holland, 1987.

    Google Scholar 

  20. Marek A. Suchenek. Minimal models for closed world data bases. In Fourth International Symposium on Methodologies for Intelligent Systems, North-Holland, Charlotte, N.C., October 12–14 1989. To appear in Proceedings of the Symposium.

    Google Scholar 

  21. Marek A. Suchenek. A syntactic characterization of minimal entailment. In North American Conference on Logic Programming, MIT Press, Cleveland, OH, October 16–20 1989. To appear in Proceedings of the Conference.

    Google Scholar 

  22. Marek A. Suchenek. Two applications of model-theoretic forcing to Lipski's data bases with incomplete information. Fundamenta Informaticae, 12:269–288, 1989.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Wichita State University, 67208, Wichita, KA

    Marek A. Suchenek

Authors
  1. Marek A. Suchenek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Clifford H. Bergman Roger D. Maddux Don L. Pigozzi

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suchenek, M.A. (1990). Incremental models of updating data bases. In: Bergman, C.H., Maddux, R.D., Pigozzi, D.L. (eds) Algebraic Logic and Universal Algebra in Computer Science. ALUACS 1988. Lecture Notes in Computer Science, vol 425. Springer, New York, NY. https://doi.org/10.1007/BFb0043088

Download citation

  • DOI: https://doi.org/10.1007/BFb0043088

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97288-6

  • Online ISBN: 978-0-387-34804-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation