On the Complexity of SingleRule Datalog Queries
 Georg Gottlob,
 Christos Papadimitriou
 … show all 2 hide
Abstract
Datalog is a wellknown database query language based on the logic programming paradigm. A general datalog program consists of a number of rules and facts. Programs containing a unique rule and possibly some facts are called single rule programs (sirups). We study both the combined and the program complexity of sirups, ie., the complexity of evaluating sirups over variable and fixed databases, respectively. Moreover, we study the descriptive complexity of sirups, i.e., their expressive power. In all cases it turns out that even very restricted classes of sirups have the same complexity and essentially the same expressive power as general datalog programs. We show that the evaluation of single clause programs is EXPTIME complete (combined complexity), and, if restricted to linear recursive rules, PSPACE complete. Moreover, sirups with one recursive rule and one additional fact capture PTIME on ordered structures, if a certain data representation is assumed and certain predefined relations are provided. Our results are obtained by a uniform product construction which maps a datalog program into a single rule by essentially maintaining its semantics. We also prove that the datalog clause implication problem, i.e., deciding whether a datalog clause implies another one, is EXPTIME complete.
 S. Aanderaa. On the Decision Problem for Formulas in which all Disjunctions are binary. Proc. of the 2nd Scandinavian Logic Symposium, pp. 1–18, North Holland Publishing Company, 1971.
 S. Abiteboul. Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters, 32(6):281–289, 1989. CrossRef
 S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. AddisonWesley, 1995.
 F. Afrati and C. H. Papadimitriou. The parallel complexity of simple logic programs. Journal of the Association for Computing Machinery, 40(4):891–916, 1993.
 E. Börger Reduktionstypen in Kromund Hornformeln. Ph.D. Dissertation, Minister, Germany, 1971.
 E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, Berlin Heidelberg, 1997.
 S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Surveys in Computer Science. Springer Verlag, 1990.
 A. K. Chandra, H. Lewis, and J. Makowsky. Embedded implicational dependencies and their inference problem. In ACM Symposium on Theory of Computing (STOC), pages 342–354, 1981.
 A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. Ninth ACM Symposium on the Theory of Computing, pages 77–90, 1977.
 E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In Proceedings Twelfth Annual IEEE Conference on Computational Complexity, pages 82–101, Ulm, Germany, June 1997. Full version available from the authors.
 P. Devienne, P. Lebègue, and J.C. Routier. Halting problem of one binary Horn clause is undecidable. In P. Enjalbert, A. Finkel, and K. Wagner, editors, Proceedings Tenth Symposium on Theoretical Aspects of Computing (STACS93), number 665 in LNCS, pages 48–57, Würzburg, February 1993. Springer.
 H.D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer, 1995.
 M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th International Conference and Symposium on Logic Programming, pages 1070–1080. The MIT Press, 1988.
 G. Gottlob. Subsumption and implication. Information Processing Letters, 24(2):109–111, 1987. CrossRef
 E. Grädel. The Expressive Power of SecondOrder Horn Logic. In Proceedings STACS91, LNCS 480, pages 466–477, 1991. CrossRef
 E. Grädel. Capturing Complexity Classes with Fragments of Second Order Logic. Theoretical Computer Science, 101:35–57, 1992. CrossRef
 Y. Gurevich. Logic and the Challenge of Computer Science. In E. Börger, editor, Trends in Theoretical Computer Science, chapter 1. Computer Science Press, 1988.
 P. Hanschke and J. Würtz. Satisfiability of the smallest binary program. Information Processing Utters, 45(5):237–241, 1993. CrossRef
 G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi. Undecidable boundedness problems for datalog programs. Journal of Logic Programming, 25(2):163–190, 1995. CrossRef
 N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986. CrossRef
 N. Immerman. Descriptive Complexity Theory. Springer, 1998 (to appear).
 P. Kanellakis. Logic programming and parallel complexity. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 547–586. Morgan Kaufmann, 1988.
 J. U. Kietz, S. Dzeroski. Inductive Logic Programming and Learnability. SIGART Bulletin 5(1), pp. 22–32,1994. CrossRef
 H. Lewis. Krom Formulas with One Dyadic Predicate Letter. Journal of Symbolic Logic, 46(2):341–362, 1976.
 J. Marcinkowski. The 3 frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs. In ACM Symposium on Theory of Computing (STOC), volume 1046 of Lecture Notes in Computer Science, pages 427–438. Springer Verlag, 1996.
 J. Marcinkowski. DATALOG SIRUPs uniform boundedness is undecidable. In Proc. IEEE Conference on Logic in Computer Science (LICS), pages 13–24. IEEE Computer Society Press, 1996.
 J. Marcinkowski and L. Pacholski. Undecidability of the Hornclause implication problem. In Proc. IEEE International Conference of Foundations of Computer Science (FOCS), pages 354–362. IEEE Computer Society Press, 1992.
 L. J. Stockmeyer. The PolynomialTime Hierarchy. Theoretical Computer Science, 3:1–22, 1977. CrossRef
 J. D. Ullman and A. van Gelder. Parallel complexity of logical query programs. Algorithmica, 3:5–42, 1988. CrossRef
 J. Ullman. Database and KnowledgeBase Systems, volume I. Computer Science Press, 1988.
 J. Ullman. Database and KnowledgeBase Systems, volume II. Computer Science Press, 1989.
 M. Vardi. Complexity of Relational Query Languages. In Proceedings 14th STOC, pages 137–146, San Francisco, 1982.
 Title
 On the Complexity of SingleRule Datalog Queries
 Book Title
 Logic for Programming and Automated Reasoning
 Book Subtitle
 6th International Conference, LPAR’99 Tbilisi, Georgia, September 6–10, 1999 Proceedings
 Pages
 pp 201222
 Copyright
 1999
 DOI
 10.1007/3540482423_13
 Print ISBN
 9783540664925
 Online ISBN
 9783540482420
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1705
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Harald Ganzinger ^{(1)}
 David McAllester ^{(2)}
 Andrei Voronkov ^{(3)}
 Editor Affiliations

 1. MaxPlanckInstitut für Informatik
 2. AT&T Labs Research
 3. Department of Computer Science, University of Manchester
 Authors

 Georg Gottlob ^{(6)}
 Christos Papadimitriou ^{(6)}
 Author Affiliations

 6. Computer Science Division, Dept of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA, 94720
Continue reading...
To view the rest of this content please follow the download PDF link above.