Default Logic as a Query Language.

@article{DBLP:journals/tkde/CadoliEG97,
  author    = {Marco Cadoli and
               Thomas Eiter and
               Georg Gottlob},
  title     = {Default Logic as a Query Language},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {9},
  number    = {3},
  year      = {1997},
  pages     = {448-463},
  ee        = {db/journals/tkde/CadoliEG97.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

References

[1]

Marco Cadoli, Marco Schaerf: A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17(2/3&4): 127-160(1993) BibTeX

[2]

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

[3]

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

[4]

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

[5]

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

[6]

Nicole Bidoit, Christine Froidevaux: Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming. LICS 1987: 89-97 BibTeX

[7]

Nicole Bidoit, Christine Froidevaux: General Logical Databases and Programs: Default Logic Semantics and Stratification. Inf. Comput. 91(1): 15-54(1991) BibTeX

[8]

Domenico Saccà: Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems. Inf. Process. Lett. 58(5): 249-254(1996) BibTeX

[9]

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

[10]

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

[11]

Raymond Reiter: A Logic for Default Reasoning. Artif. Intell. 13(1-2): 81-132(1980) BibTeX

[12]

Georg Gottlob: Complexity Results for Nonmonotonic Logics. J. Log. Comput. 2(3): 397-425(1992) BibTeX

[13]

Jonathan Stillman: The Complexity of Propositional Default Logics. AAAI 1992: 794-799 BibTeX

[14]

Serge Abiteboul, Victor Vianu: Expressive Power of Query Languages. Theoretical Studies in Computer Science 1992: 207-251 BibTeX

[15]

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

[16]

Iain A. Stewart: Comparing the Expressibility of Languages Formed using NP-Complete Operators. J. Log. Comput. 1(3): 305-330(1991) BibTeX

[17]

David Poole: Normality and Faults in Logic-Based Diagnosis. IJCAI 1989: 1304-1310 BibTeX

[18]

Luca Console, Daniele Theseider Dupré, Pietro Torasso: On the Relationship between Abduction and Deduction. J. Log. Comput. 1(5): 661-690(1991) BibTeX

[19]

...

[20]

...

[21]

...

[22]

Thomas Eiter, Georg Gottlob: The Complexity of Logic-Based Abduction. J. ACM 42(1): 3-42(1995) BibTeX

[23]

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

[24]

Marco Cadoli, Maurizio Lenzerini: The Complexity of Propositional Closed World Reasoning and Circumscription. J. Comput. Syst. Sci. 48(2): 255-310(1994) BibTeX

[25]

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

[26]

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

[27]

Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX

[28]

Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 BibTeX

[29]

...

[30]

...

[31]

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

[32]

Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9 BibTeX

[33]

...

[34]

Larry J. Stockmeyer: The Polynomial-Time Hierarchy. Theor. Comput. Sci. 3(1): 1-22(1976) BibTeX

[35]

James F. Lynch: Complexity Classes and Theories of Finite Models. Mathematical Systems Theory 15(2): 127-144(1982) BibTeX

[36]

...

[37]

Nicole Bidoit, Christine Froidevaux: Negation by Default and Unstratifiable Logic Programs. Theor. Comput. Sci. 78(1): 86-112(1991) BibTeX

[38]

Henry A. Kautz, Bart Selman: Hard Problems for Simple Default Logics. Artif. Intell. 49(1-3): 243-279(1991) BibTeX

[39]

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

[40]

...

[41]

...

[42]

...

[43]

Chiaki Sakama, Katsumi Inoue: Relating Disjunctive Logic Programs to Default Theories. LPNMR 1993: 266-282 BibTeX

[44]

Klaus W. Wagner: Bounded Query Classes. SIAM J. Comput. 19(5): 833-846(1990) BibTeX

[45]

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

[46]

Domenico Saccà: The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries. J. Comput. Syst. Sci. 54(3): 441-464(1997) BibTeX

[47]

Ravi Krishnamurthy, Shamim A. Naqvi: Non-Deterministic Choice in Datalog. JCDKB 1988: 416-424 BibTeX

[48]

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

[49]

Luca Corciulo, Fosca Giannotti, Dino Pedreschi: Datalog with Non-Deterministic Choice Computes NDB-PTIME. DOOD 1993: 49-66 BibTeX

[50]

Serge Abiteboul, Victor Vianu: Non-Determinism in Logic-Based Languages. Ann. Math. Artif. Intell. 3(2-4): 151-186(1991) BibTeX

[51]

Marco Cadoli, Thomas Eiter, Georg Gottlob: Default Logic as a Query Language. KR 1994: 99-108 BibTeX

Referenced by

1. Thomas Eiter, Georg Gottlob, Heikki Mannila: Disjunctive Datalog. ACM Trans. Database Syst. 22(3): 364-418(1997)