Skip to main content
SpringerLink
Log in
Book cover

Symposium on Mathematical Fundamentals of Database Systems

MFDBS 1991: MFDBS 91 pp 357–371Cite as

A database needs two kinds of negation

  • Modeling
  • Conference paper
  • First Online:

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

Abstract

Databases do not usually allow for the representation of explicit negative information. We show that the concept of strong negation, already known from partial logic and constructive logic, provides a computationally feasible means to represent and process explicit negative information. On the other hand it seems desirable to retain the usual form of negation in databases, viz negation-as-failure which we also call weak negation. We show how the interaction between strong and weak negation can be modelled within the framework of partial logic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and M. Bezem: Acyclic Programs, in D. Warren and P. Szeredi (eds.), Logic Programming: Proc. Int. Conf. and Symp. 1990

    Google Scholar 

  2. E.F. Codd: A Relational Model of Data for Large Shared Data Banks, Communications of the ACM 13/6 (1970), 377–387

    Article  Google Scholar 

  3. N.C.A. da Costa, L.J. Henschen, J.J. Lu and V.S. Subrahmanian: Automatic Theorem Proving in Paraconsistent Logics, in M.E. Stickel (ed.), Proc. 10th Int. Conf. Automated Deduction 1990, Springer Lecture Notes in AI, Vol. 449

    Google Scholar 

  4. A. Van Gelder, K. Ross and J.S. Schlipf: Unfounded Sets and Well-founded Semantics for General Logic Programs, in Proc. 7th Symp. on Principles of Database Systems 1988, 221–230

    Google Scholar 

  5. M. Gelfond and V. Lifschitz: Logic Programs with Classical Negation, in D. Warren and P. Szeredi (eds.), Logic Programming: Proc. Int. Conf. and Symp. 1990

    Google Scholar 

  6. S. Körner: Experience and theory, Kegan Paul, London 1966

    Google Scholar 

  7. R. Kowalski and F. Sadri: Logic Programs with Exceptions, in D. Warren and P. Szeredi (eds.), Logic Programming: Proc. Int. Conf. and Symp. 1990

    Google Scholar 

  8. T. Langholm: Partiality, Truth and Persistence, CSLI Lecture Notes No. 15, University of Chicago Press, 1988

    Google Scholar 

  9. H.J. Levesque: Making Believers out of Computers, AI 30 (1986), 81–107

    Google Scholar 

  10. D. Nelson: Constructible falsity, JSL 14 (1949), 16–26

    Google Scholar 

  11. D. Pearce and G. Wagner: Reasoning with Negative Information I — Strong Negation in Logic Programs, LWI Technical Report 4/1989, Freie Universität Berlin, also in L. Haarparanta (ed.), Proc. Symp. on the Philosophy of Jaakko Hintikka, Helsinki 1990

    Google Scholar 

  12. T.C. Przymusinski: On the Declarative Semantics of Stratified Deductive Databases and Logic Programs, in J. Minker (ed.): Foundations of Deductive Databases and Logic Programming, Morgan Kaufman, 1988

    Google Scholar 

  13. T.C. Przymusinski: On the Declarative and Procedural Semantics of Logic Programs, J. Automated Reasoning 5 (1989), 167–205

    Google Scholar 

  14. T.C. Przymusinski: Non-Monotonic Formalisms and Logic Programming, in Proc. Conf. on Logic Programming 1989, MIT 1989

    Google Scholar 

  15. T.C. Przymusinski: Well-founded Semantics Coincides with Three-Valued Stable Semantics, Fundamenta Informaticae XIII (1990), 445–463

    Google Scholar 

  16. A. Rajasekar, J. Lobo and J. Minker: Weak Generalized Closed World Assumption, J. Automated Reasoning 5 (1989), 293–307

    Google Scholar 

  17. R. Reiter: On Closed-World Databases, in J. Minker and H. Gallaire (eds.): Logic and Databases, Plenum Press, 1978

    Google Scholar 

  18. G. Wagner: The Two Sources of Nonmonotonicity in Vivid Logic — Inconsistency Handling and Weak Falsity, in G. Brewka and H. Freitag (eds.), Proc. of the GMD Workshop on Nonmonotonic Reasoning 1989, Gesellschaft für Mathematik und Datenverarbeitung, Bonn — St. Augustin, 1990

    Google Scholar 

  19. G. Wagner: Logic Programming with Strong Negation and Inexact Predicates, LWI Technical Report 11/1990, Freie Universität Berlin, also to appear in Journal of Logic and Computation

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gruppe für Logik, Wissenstheorie und Information, Freie Universität Berlin, Germany

    Gerd Wagner

  2. Undinestr. 4, D-1000, Berlin 45

    Gerd Wagner

Authors
  1. Gerd Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim János Demetrovics H. -D. Gerhardt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, G. (1991). A database needs two kinds of negation. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-54009-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47348-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation