Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries.

@inproceedings{DBLP:conf/icdt/Sacca95,
  author    = {Domenico Sacc{\`a}},
  editor    = {Georg Gottlob and
               Moshe Y. Vardi},
  title     = {Deterministic and Non-Deterministic Stable Model Semantics for
               Unbound DATALOG Queries},
  booktitle = {Database Theory - ICDT'95, 5th International Conference, Prague,
               Czech Republic, January 11-13, 1995, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {893},
  year      = {1995},
  isbn      = {3-540-58907-4},
  pages     = {353-367},
  ee        = {db/conf/icdt/Sacca95.html},
  crossref  = {DBLP:conf/icdt/95},
  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

[1]

Serge Abiteboul, Eric Simon, Victor Vianu: Non-Deterministic Languages to Express Deterministic Transformations. PODS 1990: 218-229 BibTeX

[2]

Chitta Baral, V. S. Subrahmanian: Stable and Extension Class Theory for Logic Programs and Default Logics. J. Autom. Reasoning 8(3): 345-366(1992) BibTeX

[3]

Nicole Bidoit: Negation in Rule-Based Database Languages: A Survey. Theor. Comput. Sci. 78(1): 3-83(1991) BibTeX

[4]

Stefano Ceri, Georg Gottlob, Letizia Tanca: Logic Programming and Databases. Springer 1990, ISBN 3-540-51728-6
BibTeX

[5]

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128(1982) BibTeX

[6]

Phan Minh Dung: Negations as Hypotheses: An Abductive Foundation for Logic Programming. ICLP 1991: 3-17 BibTeX

[7]

Thomas Eiter, Georg Gottlob, Heikki Mannila: Adding Disjunction to Datalog. PODS 1994: 267-278 BibTeX

[8]

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

[9]

Fosca Giannotti, Dino Pedreschi, Domenico Saccà, Carlo Zaniolo: Non-Determinism in Deductive Databases. DOOD 1991: 129-146 BibTeX

[10]

...

[11]

Neil Immerman: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778(1987) BibTeX

[12]

David S. Johnson: A Catalog of Complexity Classes. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 67-161 BibTeX

[13]

Paris C. Kanellakis: Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1073-1156 BibTeX

[14]

Phokion G. Kolaitis: The Expressive Power of Stratified Programs. Inf. Comput. 90(1): 50-66(1991) BibTeX

[15]

Phokion G. Kolaitis, Christos H. Papadimitriou: Why not Negation by Fixpoint? J. Comput. Syst. Sci. 43(1): 125-144(1991) BibTeX

[16]

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

[17]

V. Wiktor Marek, Miroslaw Truszczynski: Autoepistemic Logic. J. ACM 38(3): 588-619(1991) BibTeX

[18]

...

[19]

...

[20]

...

[21]

Domenico Saccà, Carlo Zaniolo: Stable Models and Non-Determinism in Logic Programs with Negation. PODS 1990: 205-217 BibTeX

[22]

...

[23]

John S. Schlipf: The Expressive Powers of the Logic Programming Semantics. PODS 1990: 196-204 BibTeX

[24]

...

[25-1]

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

[25-2]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX

[26]

Jan Van den Bussche, Dirk Van Gucht: Semi-determinism. PODS 1992: 191-201 BibTeX

[27]

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650(1991) BibTeX

[28]

Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146 BibTeX

[29]

Jia-Huai You, Li-Yan Yuan: Three-Valued Formalization of Logic Programming: Is It Needed? PODS 1990: 172-182 BibTeX