
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Marco Cadoli, Thomas Eiter, Georg Gottlob, "Default Logic as a Query Language," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 448463, MayJune, 1997.  
BibTex  x  
@article{ 10.1109/69.599933, author = {Marco Cadoli and Thomas Eiter and Georg Gottlob}, title = {Default Logic as a Query Language}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {9}, number = {3}, issn = {10414347}, year = {1997}, pages = {448463}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.599933}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Default Logic as a Query Language IS  3 SN  10414347 SP448 EP463 EPD  448463 A1  Marco Cadoli, A1  Thomas Eiter, A1  Georg Gottlob, PY  1997 KW  Nonmonotonic reasoning KW  default logic KW  query languages KW  relational databases KW  expressive power. VL  9 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about the world via rules that are generally true but can be defeated. Even if relational databases are nowadays the main tool for storing very large sets of data, the approach of using nonmonotonic AI formalisms as relational database query languages has been investigated to a much smaller extent. In this work, we propose a novel application of Reiter's default logic by introducing a
[1] M. Cadoli and M. Schaerf, "A Survey of Complexity Results for Nonmonotonic Logic," J. Logic Programming, vol. 17, pp. 127160, 1993.
[2] P.C. Kanellakis, "Elements of Relational Database Theory," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., chapter 17, Elsevier Science, 1990.
[3] P.G. Kolaitis and C.H. Papadimitriou, "Why Not Negation by Fixpoint?" J. Computer and System Sciences, vol. 43, pp. 125144, 1991.
[4] J.S. Schlipf, "The Expressive Powers of the Logic Programming Semantics (extended abstract)," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 196204, 1990.
[5] M. Gelfond and V. Lifschitz, "The Stable Model Semantics for Logic Programming," Proc. Fifth Logic Programming Symp., pp. 1,0701,080.Cambridge, Mass.: MIT Press, 1988.
[6] N. Bidoit and C. Froidevaux, "Minimalism Subsumes Default Logic and Circumscription in Stratified Logic Programming," Proc. LICS87, pp. 8997, 1987.
[7] N. Bidoit and C. Froidevaux, "General Logic Databases and Programs: Default Semantics and Stratification," Information and Computation, vol. 19, pp. 1554, 1991.
[8] D. Saccà, "Multiple Stable Models Are Needed to Solve Unique Solution Problems," Informal Proc. Second Compulog Net Meeting on Knowledge Bases (CNKBS93),Athens, Apr. 1993.
[9] A. van Gelder, "The Alternating Fixpoint of Logic Programs with Negation," Proc. ACM Symp. Principles of Database Systems, pp. 110, 1989.
[10] A. van Gelder,K. Ross, and J.S. Schlipf,"The wellfounded semantics for general logic programs," J. ACM, vol. 38, no. 3, pp. 620650, July 1991.
[11] R. Reiter, "A Logic for Default Reasoning," Artificial Intelligence, vol. 13, pp. 81132, 1980.
[12] G. Gottlob, "Complexity Results for Nonmonotonic Logics," J. Logic and Computation, vol. 2, no. 3, pp. 397425, June 1992.
[13] J. Stillman, "The Complexity of Propositional Default Logic," Proc. AAAI92, pp. 794799, 1992.
[14] S. Abiteboul and V. Vianu, "Expressive Power of Query Languages," Theoretical Studies in Computer Science, J. Ullman, ed. Academic Press, 1992, Festschrift in Honour of Seymour Ginsburg's 64th Birthday.
[15] T. Eiter, G. Gottlob, and H. Mannila, "Adding Disjunction to Datalog," Proc. 13th ACM SIGACT SIGMODSIGART Symp. Principles of Database Systems (PODS94), pp. 267278, May 1994.
[16] I. Stewart, "Comparing the Expressibility of Languages Formed Using NPComplete Operators," J. Logic and Computation, vol. 1, no. 3, pp. 305330, 1991.
[17] D. Poole, "Normality and Faults in Logic Based Diagnosis," Proc. IJCAI89, pp. 1,3041,310, 1989.
[18] L. Console, D. Theseider Duprè, and P. Torasson, "On the Relationship Between Abduction and Deduction," J. Logic and Computation, vol. 1, no. 5, pp. 661690, 1991.
[19] Proc. Int'l Workshop Expert Systems in Eng., G. Gottlob and W. Nejdl, eds., Lecture Notes in AI no. 462, Sept. 1990.
[20] Readings in ModelBased Diagnosis, W. Hamscher, ed. Morgan Kaufmann, 1992.
[21] Y. Peng and J.A. Reggia, Abductive Inference Models for Diagnostic ProblemSolving, SpringerVerlag, New York, 1990.
[22] T. Eiter and G. Gottlob, "The Complexity of LogicBased Abduction," J. ACM, vol. 42, no. 1, pp. 342, Jan. 1995.
[23] D.S. Johnson, "A Catalog of Complexity Classes," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, chapter 2. NorthHolland: Elsevier Science Publishers B.V., 1990.
[24] M. Cadoli and M. Lenzerini, "The Complexity of Propositional Closed World Reasoning and Circumscription," J. Computer and System Sciences, vol. 43, pp. 165211, Apr. 1994.
[25] T. Eiter and G. Gottlob, "Complexity Aspects of Various Semantics for Disjunctive Databases," Proc. 12th ACM SIGACT SIGMODSIGART Symp. Principles of Database Systems (PODS93), pp. 158167, June 1993.
[26] J. Ullman, Principles of Database and KnowledgeBase Systems, vol. 1. Computer Science Press, 1988.
[27] S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. AddisonWesley, 1995.
[28] A.V. Aho and J.D. Ullman,“Universality of data retrieval languages,” Proc. Sixth ACM Symp. Principles of Programming Languages, Jan. 1979.
[29] Y. Gurevich, "Logic and the Challenge of Computer Science," Trends in Theoretical Computer Science, E. Börger, ed., chapter 1. Computer Science Press, 1988.
[30] R. Fagin, "Generalized FirstOrder Spectra and PolynomialTime Recognizable Sets," Complexity of Computation, R.M. Karp, ed., pp. 4374. AMS, 1974.
[31] N. Immerman, "Languages that Capture Complexity Classes," SIAM J. Computing, vol. 16, pp. 760778, 1987.
[32] A.K. Chandra, "Theory of Database Queries," Proc. PODS88, 1988.
[33] C.H. Papadimitriou, "A Note on the Expressive Power of Datalog," Bulletin EATCS, vol. 26, pp. 2123, 1985.
[34] L.J. Stockmeyer, "The PolynomialTime Hierarchy," Theoretical Computer Science, vol. 3, pp. 122, 1977.
[35] J.F. Lynch, "Complexity Classes and Theories of Finite Models," Math. Systems Theory, vol. 15, pp. 127144, 1982.
[36] W. Marek and M. Truszczynski, Nonmonotonic Logics—ContextDependent Reasoning. Springer, 1993.
[37] N. Bidoit and C. Froidevaux, "Negation by Default and Unstratifiable Programs," Theoretical Computer Science, vol. 78, pp. 85112, 1991.
[38] H. Kautz and B. Selman, "Hard Problems for Simple Default Logics," Artificial Intelligence, vol. 49, pp. 243279, 1991.
[39] R. Reiter, "Towards a Reconstruction of Logical Databases," On Conceptual Modeling, J.W. Schmidt, M.L. Brodie, and J.L. Mylopoulos, eds., pp. 163189.New York: Springer, 1984.
[40] C.H. Papadimitriou, Computational Complexity. AddisonWesley, 1994.
[41] C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian, "Implementing Stable Semantics by Linear Programming," J. ACM, vol. 42, no. 1, Jan. 1995.
[42] W. Lukasiewicz, NonMonotonic Reasoning.Chichester, England: Ellis Horwood, 1990.
[43] C. Sakama and K. Inoue, "Relating Disjunctive Logic Programs to Default Theories," Proc. Second Int'l Workshop Logic Programming and Nonmonotonic Reasoning (LPNMR93), L.M. Pereira and A. Nerode, eds., pp. 266282,Lisbon, July 1993.
[44] K. Wagner, "Bounded Query Classes," SIAM J. Computing, vol. 19, no. 5, pp. 833846, 1990.
[45] W. Marek and M. Truszczynski, "Autoepistemic Logic," J. ACM, vol. 38, no. 3, pp. 588619, 1991.
[46] D. Saccà, "The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries," J. Computer and System Sciences, 1995.
[47] R. Krishnamurthy and S.A. Naqvi, "Nondeterministic Choice in Datalog," Proc. Fifth Int'l Conf. Data and Knowledge Bases, pp. 416424,Los Altos, Calif., 1988.
[48] D. Saccà and C. Zaniolo, "Stable Models and Nondeterminism for Logic Programs with Negation," ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 205217, 1990.
[49] L. Corciulo, F. Giannotti, and D. Pedreschi, "Datalog with Nondeterministic Choice Computes NBDTIME," Proc. Int'l Conf. Deductive and ObjectOriented Databases (DOOD93), 1993.
[50] S. Abiteboul and V. Vianu, "NonDeterminism in LogicBased Languages," Annals of Math. and Artificial Intelligence, vol. 3, pp. 151186, 1991.
[51] M. Cadoli, T. Eiter, and G. Gottlob, "Default Logic as a Query Language," Technical Report CDTR 94/65, Christian Doppler Laboratory for Expert Systems, Technical Univ. of Vienna, Austria, May 1994. Preliminary version in Proc. Fourth Int'l Conf. Principles of Knowledge Representation and Reasoning (KR94), May 1994.