A Possible World Semantics for Disjunctive Databases.

@article{DBLP:journals/tkde/Chan93,
  author    = {Edward P. F. Chan},
  title     = {A Possible World Semantics for Disjunctive Databases},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {5},
  number    = {2},
  year      = {1993},
  pages     = {282-292},
  ee        = {db/journals/tkde/Chan93.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society 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/An3-3 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/aDVD2 or /dvd

References

[1]

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148 BibTeX

[2]

Nicole Bidoit, Richard Hull: Positivism vs. Minimalism in Deductive Databases. PODS 1986: 123-132 BibTeX

[3]

Jan Chomicki, V. S. Subrahmanian: Generalized Closed World Assumptions is Pi^0_2-Complete. Inf. Process. Lett. 34(6): 289-291(1990) BibTeX

[4]

Keith L. Clark: Negation as Failure. Logic and Data Bases 1977: 293-322 BibTeX

[5]

Maarten H. van Emden, Robert A. Kowalski: The Semantics of Predicate Logic as a Programming Language. J. ACM 23(4): 733-742(1976) BibTeX

[6]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[7]

Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080 BibTeX

[8]

Michael Gelfond, Halina Przymusinska, Teodor C. Przymusinski: The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. PODS 1986: 133-139 BibTeX

[9]

John Grant, Jack Minker: Answering Queries in Indefinite Databases and the Null Value Problem. Advances in Computing Research 3: 247-267(1986) BibTeX

[10]

Lawrence J. Henschen, Hyung-Sik Park: Compiling the GCWA in Indefinite Deductive Databases. Foundations of Deductive Databases and Logic Programming. 1988: 395-438 BibTeX

[11]

...

[12]

John W. Lloyd: Foundations of Logic Programming, 2nd Edition. Springer 1987, ISBN 3-540-18199-7
BibTeX

[13]

Vladimir Lifschitz: On the Declarative Semantics of Logic Programs with Negation. Foundations of Deductive Databases and Logic Programming. 1988: 177-192 BibTeX

[14]

Eliezer L. Lozinskii: Plausible World Assumption. KR 1989: 266-275 BibTeX

[15]

Jack Minker: On Indefinite Databases and the Closed World Assumption. CADE 1982: 292-308 BibTeX

[16]

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

[17]

...

[18]

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

[19]

Raymond Reiter: Towards a Logical Reconstruction of Relational Database Theory. On Conceptual Modelling (Intervale) 1982: 191-233 BibTeX

[20]

Kenneth A. Ross: The Well Founded Semantics for Disjunctive Logic Programs. DOOD 1989: 385-402 BibTeX

[21]

Kenneth A. Ross, Rodney W. Topor: Inferring Negative Information from Disjunctive Databases. J. Autom. Reasoning 4(4): 397-424(1988) BibTeX

[22]

Chiaki Sakama: Possible Model Semantics for Disjunctive Databases. DOOD 1989: 369-383 BibTeX

[23]

John C. Shepherdson: Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. J. Log. Program. 1(1): 51-79(1984) BibTeX

[24]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[25]

Allen Van Gelder: Negation as Failure Using Tight Derivations for General Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 149-176 BibTeX

[26]

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

[27]

Allen Van Gelder: The Alternating Fixpoint of Logic Programs with Negation. PODS 1989: 1-10 BibTeX

[28]

Adnan H. Yahya, Lawrence J. Henschen: Deduction in Non-Horn Databases. J. Autom. Reasoning 1(2): 141-160(1985) BibTeX

Referenced by

1. Thomas Eiter, Georg Gottlob: Complexity Aspects of Various Semantics for Disjunctive Databases. PODS 1993: 158-167