A Database Needs Two Kinds of Negation.

@inproceedings{DBLP:conf/mfdbs/Wagner91,
  author    = {Gerd Wagner},
  editor    = {Bernhard Thalheim and
               J{\'a}nos Demetrovics and
               Hans-Detlef Gerhardt},
  title     = {A Database Needs Two Kinds of Negation},
  booktitle = {MFDBS 91, 3rd Symposium on Mathematical Fundamentals of Database
               and Knowledge Bases Systems, Rostock, Germany, May 6-9, 1991,
               Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {495},
  year      = {1991},
  isbn      = {3-540-54009-1},
  pages     = {357-371},
  ee        = {db/conf/mfdbs/Wagner91.html},
  crossref  = {DBLP:conf/mfdbs/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[Apt & Bezem 1990]

Krzysztof R. Apt, Marc Bezem: Acyclic Programs. ICLP 1990: 617-633 BibTeX

[Codd 1979]

E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) BibTeX

[da Costa et al. 1990]

Newton C. A. da Costa, Lawrence J. Henschen, James J. Lu, V. S. Subrahmanian: Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation. CADE 1990: 72-86 BibTeX

[Van Gelder, Ross & Schlipf 1988]

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS 1988: 221-230 BibTeX

[Gelfond & Lifschitz 1990]

Michael Gelfond, Vladimir Lifschitz: Logic Programs with Classical Negation. ICLP 1990: 579-597 BibTeX

[Körner 1966]

...

[Kowalski & Sadri 1990]

Robert A. Kowalski, Fariba Sadri: Logic Programs with Exceptions. ICLP 1990: 598-613 BibTeX

[Langholm 1988]

...

[Levesque 1986]

Hector J. Levesque: Making Believers out of Computers. Artif. Intell. 30(1): 81-108(1986) BibTeX

[Nelson 1949]

...

[Pearce & Wagner 1989]

...

[Przymusinksi 1988a]

Teodor C. Przymusinski: On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216 BibTeX

[Przymusinksi 1988b]

Teodor C. Przymusinski: On the Declarative and Procedural Semantics of Logic Programs. J. Autom. Reasoning 5(2): 167-205(1989) BibTeX

[Przymusinksi 1989]

Teodor C. Przymusinski: Non-Monotonic Formalisms and Logic Programming. ICLP 1989: 655-674 BibTeX

[Przymusinksi 1990]

...

[Rajasekar, Lobo & Minker]

Arcot Rajasekar, Jorge Lobo, Jack Minker: Weak Generalized Closed World Assumption. J. Autom. Reasoning 5(3): 293-307(1989) BibTeX

[Reiter 1978]

Raymond Reiter: On Closed World Data Bases. Logic and Data Bases 1977: 55-76 BibTeX

[Wagner 1990a]

...

[Wagner 1990b]

Gerd Wagner: Logic Programming with Strong Negation and Inexact Predicates. J. Log. Comput. 1(6): 835-859(1991) BibTeX

Referenced by

1. Norbert Fuhr, Thomas Rölleke: HySpirit - A Probabilistic Inference Engine for Hypermedia Retrieval in Large Databases. EDBT 1998: 24-38