Skip to main content

Model theory of deductive databases

  • Conference paper
  • First Online:
Book cover CSL '87 (CSL 1987)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bacsich, P.D.: Defining algebraic elements, J.Symb.Logic. 38(1973), 93–101

    Google Scholar 

  2. Bacsich, P.D.: Model theory of epimorphisms, Canad.Math.Bull. 17(1974), 471–477

    Google Scholar 

  3. Bacsich. P.D.,Rowlands-Hughes, D.: Syntactic characterisations of amalgamations, convexity and related properties, J.Symb.Logic 39(1974), 433–451

    Google Scholar 

  4. Boasu, G.,Siegel, P.: Saturation, nonmonotonic reasoning and the closed world assumption, Artificial Intelligence 25(1985), 13–63

    Google Scholar 

  5. Cherlin,G.L., Volger,H.: Convexity properties and algebraic closure operators, in: Models and Sets, Proc.Logic Colloq.'83, Aachen, part 1, Lecture Notes in Math. 1103, Springer Verlag 1984, 113–146

    Google Scholar 

  6. Clark,K.L.: Negation as failure, in: Logic and Databases, (Gallaire,H.,Minker,J.,eds.), Plenum Press 1978, 293–324

    Google Scholar 

  7. Gallaire, H.,Minker, J.,Nicolas, J.-M.: Logic and databases: a deductive approach, Computing Surveys 16(1984), 153–185

    Google Scholar 

  8. Kueker, D.W.: Core structures for theories, Fund.Math. 89(1975), 155–171

    Google Scholar 

  9. Makowsky, J.A.: Why Horn formulas matter in computer science: initial structures and generic examples, J.C.S.S. 34(1987), 266–292

    Google Scholar 

  10. Malcev,A.I.: Algebraic Systems, Akademie Verlag, Berlin 1973, english translation from russian original, Nauka, Moskwa 1968

    Google Scholar 

  11. Minker,J.: On indefinite databases and the closed world assumption, Proc.6th Conf. on Automated Deduction,Lecture Notes in Comp.Sci. 138, Springer Verlag 1982, 292–308

    Google Scholar 

  12. Pinter, C.: A note on the decomposition of theories with respect to amalgamation, convexity and related properties, Notre Dame J.Formal Logic 19(1978),115–118

    Google Scholar 

  13. Relter,R.: On closed world databases, in: Logic and Databases, (Gallaire, H.,Minker,J.,eds.), Plenum Press 1978, 55–76

    Google Scholar 

  14. Volger, H.: Preservation theorems for limits of structures and global sections of sheaves of structures, Math.Z. 166(1979), 27–53

    Google Scholar 

  15. Volger,H.: On theories which admit initial models, MIP 8708, Univ.Passau 1987, 12 pages

    Google Scholar 

  16. Yahya, A.,Henschen, L.J.: Deduction in non-Horn databases, J. Automated Reasoning 1(1985), 141–160

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Volger, H. (1988). Model theory of deductive databases. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics