Complexity and expressive power of logic programming

ACM Computing Surveys

Volumn 33, Issue 3, 2001, Pages 374-425

  Dantsin, Evgeny ^a,c,d   Eiter, Thomas ^a,b   Gottlob, Georg ^c,d   Voronkov, Andrei ^a  

^a ROOSEVELT UNIVERSITY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

^d Databases and Artificial Intelligence Group   (Austria)

Author keywords

Complexity; Datalog; Expressive power; Logic programming; Nonmonotonic logic; Query languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONSTRAINT THEORY; QUERY LANGUAGES;

CONSTRAINT LOGIC PROGRAMMING; DATALOG PROGRAMMING; TURNING MACHINES;

LOGIC PROGRAMMING;

EID: 0038062314     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/502807.502810     Document Type: Article

References (303)

1. AANDERAA, S. AND BÖRGER, E. 1979. The Horn complexity of Boolean functions and Cook's problem. In B. Mayoh and F. Jensen, Eds., Proceedings 5th Scandinavian Logic Symposium, pp. 231-256. Aalborg, Denmark: Aalborg University Press.
2. ABITEBOUL, S. 1989. Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters 32, 6, 281-287.
3. ABITEBOUL, S. AND BEERI, C. 1995. The power of languages for the manipulation of complex values. VLDB Journal 4, 4, 727-794.
4. ABITEBOUL, S. AND GRUMBACH, S. 1988. Col: A logic-based language for complex objects. In J. Schmidt, S. Ceri, and M. Missikoff, Eds., Advances in Database Technology-EDBT '88, Proceedings of the International Conference on Extending Database Technology, Venice, Italy, March 14-18,1988, Volume 303 of Lecture Notes in Computer Science (March 1988), pp. 271-293. Springer-Verlag.
5. ABITEBOUL, S. AND KANELLAKIS, P. C. 1989. Object identity as a query language primitive. In J. Clifford, B. G. Lindsay, and D. Maier, Eds., Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31-June 2, 1989 (1989), pp. 159173. ACM Press. Extended version appeared as [Abiteboul and Kanellakis 1998].
6. ABITEBOUL, S. AND KANELLAKIS, P. C. 1998. Object identity as a query language primitive. Journal of the Association for Computing Machinery 45,5 (Sept.), 798-842.
7. ABITEBOUL, S. AND VIANU, V. 1991a. Datalog extensions for database queries and updates. Journal of Computer and System Sciences 43, 1 (Aug.), 62-124.
8. ABITEBOUL, S. AND ViANU, V. 199 lb. Generic computation and its complexity. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing (STOC '91) (New Orleans, Louisiana, May 1991), pp. 209-219. Extended version appeared as [Abiteboul and Vianu 1995],
9. AEITEBOUL, S. AND VIANU, V. 1995. Computing with first-order logic. Journal of Computer and System Sciences 50, 2 (April), 309-335.
10. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley Publishing Co.
11. ABITEBOUL,S.,VARDI,M.Y.,AND VIANU, V. 1997. Fixpoint logics, relational machines, and computational complexity. Journal of the Association for Computing Machinery 44, 1 (Jan.), 30-56.
12. AFRATI, F. N. 1997. Bounded arity datalog(≠) queries on graphs. Journal of Computer and System Sciences 55, 2 (Oct.), 210-228.
13. AFRATI, F. N. AND COSMADAKIS, S. S. 1989. Expressiveness of restricted recursive queries. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC '89) (Seattle, Washington, May 1989), pp. 113-126.
14. AFRATI, F. N. AND PAPADIMITRIOU, C. H. 1993. The parallel complexity of simple logic programs. Journal of the Association for Computing Machinery 40,4 (Sept.), 891-916.
15. AFRATI, F. N., COSMADAKIS, S. S., AND YANNAKAKIS, M. 1995. On Datalog vs polynomial time. Journal of Computer and System Sciences 51, 2 (Oct.), 177-196.
16. AJTAI, M. AM) GUREVICH, Y. 1994. Datalog vs first-order logic. Journal of Computer and System Sciences 49, 3 (Dec.), 562-588.
17. ANTJRéKA, H. AND NéMETI, I. 1978. The generalized completeness of Horn predicate logic as a programming language. Acta Cybernetica 4, 3-10. (This is the published version of a 1975 report entitled "General Completeness of PROLOG".)
18. APT, K. R. 1990. Logic programming. In J. van Leeuwen, Ed., Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, Chapter 10, pp. 493-574. Elsevier Science and The MIT Press.
19. APT,K.R.ANDBLAIR,H.A. 1988. Arithmetic classification of perfect models of stratified programs. In R. A. Kowalski and K. A. Bowen, Eds., Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988 (ICLP/SLP 1988) (Aug. 1988), pp. 765-779. The MIT Press.
20. APT, K. R. AND BOL, R. N. 1994. Logic programming and negation: A survey. Journal of Logic Programming 19/20, 9-71.
21. APT, K. R. AND VAN EMDEN, M. H. 1982. Contributions to the theory of logic programming. Journal of the Association for Computing Machinery 29, 3, 841-862.
22. APT, K. R., BLAIR, H. A., AND WALKER, A. 1988. Towards a theory of declarative knowledge. In J. Minker, Ed., Foundations of Deductive Databases and Logic Programming, pp. 89-148. Washington, DC, USA: Morgan Kaufmann.
23. BAADER, F. AND SCHULZ, K. U. 1992. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur Ed., Automated Deduction-CADE-11, llth International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings, Volume 607 of Lecture Notes in Artificial Intelligence (June 1992), pp. 50-65.
24. BAADER, F. AND SCHULZ, K. U. 1996. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation 21, 2 (Feb.), 211-243.
25. BAADER, F. AND SIEKMANN, J. H. 1994. Unification theory. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds., Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 41-125. Oxford University Press.
26. BACHMAIR, L., CHEN, T., RAMAKRISHNAN, C., AND RAMAKRISHNAN, I. 1996. Subsumption algorithms based on search trees. In H. Kirchner, Ed., Trees in Algebra and Programming-CAAP '96, 21st International Colloquium, Linkping, Sweden, April, 22-24, 1996, Proceedings, Volume 1059 of Lecture Notes in Computer Science (April 1996), pp. 135-148. Springer-Verlag.
27. BALCäZAR, J. L., DíAZ, J., AND GABARRö, J. 1990. Structural Complexity II, Volume 22 ofEATCS: Monographs in Theoretical Computer Science. Springer Verlag.
28. BALCäZAR,J.L.,LozANO,A.,ANDTORAN,H. 1992. The complexity of algorithmic problems on succinct instances. In R. Baeza-Yates and U. Manber, Eds., Computer Science, pp. 351-377. New York: Plenum Press.
29. BARAL, C. AND GELFOND, M. 1994. Logic programming and knowledge representation. Journal of Logic Programming 19/20, 73-148.
30. BARAL, C. AND SUBRAHMANIAN, V. 1993. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. Journal of Automated Reasoning 10, 3 (June), 399-420.
31. BEN-ELIYAHU, R. AND DECHTER, R. 1994. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12,1-II, 53-87.
32. BENANAV, D., KAPUR, D., AND NARENDRAN, P. 1987. Complexity of matching problems. Journal of Symbolic Computation 3, 1/2 (Feb./April), 203-216.
33. BENEDICT, M. AND LIBKIN, L. 1996. On the structure of queries in constraint query languages. In Proceedings, llth Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, 27-30 July 1996 (LICS '96) (July 1996), pp. 25-34. IEEE Computer Society Press.
34. BENEDIKT, M. AND LIBKIN, L. 1997. Languages for relational databases over interpreted structures. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 12-14, 1997, Tucson, Arizona (PODS '97) (May 1997), pp. 87-98. ACM Press.
35. BENEDICT, M., DONG, G., LIBKIN, L., AND WONG, L. 1996. Relational expressive power of constraint query languages. In Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, 1996, Montreal, Canada (PODS '96) (June 1996), pp. 5-16. ACM Press.
36. HERMAN, K. A., SCHLIPF, J. S., AND FRANCO, J. V. 1995. Computing well-founded semantics faster. In V. Vf. Marek, A. Nerode, and M. Truszczyriski, Eds., Logic Programming and Nonmonotonic Reasoning, Third International Conference, LPNMR '95, Lexington, KY, USA, June 26-28, 1995, Proceedings, Volume 982 of Lecture Notes in Computer Science (June 1995), pp. 113-126. Springer-Verlag.
37. BERMAN, L. 1977. Precise bounds for Presburger arithmetic and the reals with addition: Preliminary report. In 18th Annual Symposium on Foundations of Computer Science (FOCS '77) (Providence, Rhode Island, Oct./Nov. 1977), pp. 95-99. IEEE.
38. BERMAN, L. 1980. The complexity of logical theories. Theoretical Computer Science 11, 71-77.
39. BIDOIT, N. 1991. Negation in rule-based database languages: A survey. Theoretical Computer Science 78,1 (Jan.), 3-83.
40. BIDOIT, N. AND FROIDEVAUX, C. 1991. Negation by default and unstratifiable logic programs. Theoretical Computer Science 78, 1 (Jan.), 85-112.
41. BLAIR, H. A. 1982. The recursion-theoretical complexity of the semantics of predicate logic as a programming language. Information and Control 54,1/2 (Jan.), 25-47.
42. BONATTI, P. A. AND EITER, T. 1996. Querying disjunctive databases through nonmonotonic logics. Theoretical Computer Science 160, 1&2 (June), 321-363.
43. BONNER, A. J. 1990. Hypothetical datalog: Complexity and expressibility. Theoretical Computer Science 76, 1, 3-51.
44. BONNER, A. J. 1997. Intuitionistic deductive databases and the polynomial time hierarchy. Journal of Logic Programming 33, 1 (Oct.), 1-47.
45. BORGER, E. 1971. Reduktionstypen in Krom- und Hornformeln. PhD thesis, Fachbereich Mathematik der Universität Münster.
46. BORGER, E. 1974. Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen. Archiv für mathematische Logik und Grudlagenforschung 16,1-2, 67-84.
47. BORGER, E. 1984. Decision problems in predicate logic. In G. Lolli, G. Longo, and A. Marcja, Eds., Logic Colloquium '82, Volume 112 of Studies in Logic and the Foundations of Mathematics (1984), pp. 263-301. North Holland.
48. BORGER, E., GRäDEL, E., AND GUREVICH, Y. 1997. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer-Verlag, Berlin.
49. BRASS, S. AND DK, J. 1995. Disjunctive semantics based upon partial and bottom-up evaluation. In L. Sterling, Ed., Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, June 13-16, 1995, Tokyo, Japan (ICLP '95) (June 1995), pp. 199-213. MIT Press.
50. BREWKA, G. AND EITER, T. 1998. Preferred answer sets for extended logic programs. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, Eds., Pro. ceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98), Trento, Italy, June 2-5,1998 (June 1998), pp. 86-97. Morgan Kaufmann. Full paper: [Brewka and Eiter 1999].
51. BREWKA, G. AND EITER, T. 1999. Preferred answer sets for extended logic programs. Artificial Intelligence 109,1-2 (April), 297-356.
52. BUCCAFURRI, F., GRECO, S., AND SACCà, D. 1997a. The expressive power of unique total stable model semantics. In P. Degano, R. Corrieri, and A. Marchetti-Spaccamela, Eds., Automata, Languages and Programming, 24th International Colloquium, ICALP '97, Bologna, Italy, 7-11 July 1997, Volume 1256 of Lecture Notes in Computer Science (July 1997), pp. 849-859. SpringerVerlag.
53. BUCCAFURRI, F., LEONE, N., AND RULLO, P. 1997b. Strong and weak constraints in disjunctive datalog. In J. Dix, U. Furbach, and A. Nerode, Eds., Proceedings of the Fourth International Conference on Logic Programming and NonMonotonic Reasoning, LPNMR '97, Dagstuhl, Germany, July 28-31, 1997, Number 1265 in Lecture Notes in Computer Science (July 1997), pp. 2-17. Springer-Verlag. Full paper: [Buccafurri et al. 2000].
54. BUCCAFURRI, F., LEONE, N., AND RULLO, P. 1998. Disjunctive ordered logic: Semantics and expressiveness. In A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds., Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98), Trento, Italy, June 2-5, 1998 (June 1998), pp. 418-431. Morgan Kaufmann. Full paper: [Buccafurri et al. 1999].
55. BUCCAFURRI, F., LEONE, N., AND RULLO, P. 1999. Semantics and expressiveness of disjunctive ordered logic. Annals of Mathematics and Artificial Intelligence 25, 3-1, 311-337.
56. BUCCAFURRI, F., LEONE, N., AND RULLO, P. 2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering 12, 5, 845-860.
57. BüCHI, J. 1962. Turing machines and the Entscheidungsproblem. Mathematische Annalen 148, 201-213.
58. BUNEMAN, P., NAQVI, S. A., TANNEN, V., AND WONG, L. 1995. Principles of programming with complex objects and collection types. Theoretical Computer Science 149,1 (Sept.), 3-48.
59. CADOLI, M. AND PALOPOLI, L. 1998. Circumscribing DATALOG: Expressive power and complexity. Theoretical Computer Science 193, 1-2 (Feb.), 215-244.
60. CADOLI, M. AND SCHAERF, M. 1993. A survey of complexity results for nonmonotonic logics. Journal of Logic Programming 17, 2/S&4 (Nov.), 127-160.
61. CANNY, J. 1988. Some algebraic and geometric computations in PSPACE. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88) (Chicago, Illinois, 2-4 May 1988), pp. 460-467.
62. CERI, S., GOTTLOB, G., AND TANCA, L. 1990. Logic Programming and Databases. Surveys in Computer Science. Springer-Verlag.
63. CHAN, E. P. F. 1993. A possible worlds semantics for disjunctive databases. IEEE Transactions on Knowledge and Data Engineering 5, 2 (April), 282-292.
64. CHANDRA, A. K. AND HAREL, D. 1982. Structure and complexity of relational queries. Journal of Computer and System Sciences 25,1 (Aug.), 99-128.
65. CHANDRA, A. K. AND HAREL, D. 1985. Horn clause queries and generalizations. Journal of Logic Programming 2,1 (April), 1-15.
66. CHANDRA, A. K AND MERLIN, P. M. 1977. Optimal implementation of conjunctive queries in relational data bases. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing (STOC '77) (Boulder, Colorado, 2-4 May 1977), pp. 77-90.
67. CHANDRA, A. K, KOZEN, D., AND STOCKMEYER, L. J. 1981a. Alternation. Journal of the Association for Computing Machinery 28,1 (Jan.), 114-133.
68. CHANDRA, A. K., LEWIS, H. R., AND MAKOWSKV, J. A. 198 Ib. Embedded implicational dependencies and their inference problem. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation (STOC '81) (Milwaukee, Wisconsin, 11-13 May 1981), pp. 342-354.
69. CHAUDHURI, S. AND VARDI, M. Y. 1994. On the complexity of equivalence between recursive and nonrecursive datalog programs. In Proceedings of the Thirteenth ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota (PODS '94) (May 1994), pp. 107-116. ACM Press.
70. CHAUDHURI, S. AND VARDI, M. Y. 1997. On the equivalence of recursive and nonrecursive datalog programs. Journal of Computer and System Sciences 54,1 (Feb.), 61-78.
71. CHOLAK, P. AND BLAIR, H. A. 1994. The complexity of local stratification. Fundamenta Informaticae 21, 4 (Oct.), 333-344.
72. CHOMICKI, J. AND SUBRAH.MANIAN, V. 1990. Generalized closed world assumption is Fig-complete. Information Processing Letters 34, 6 (May), 289-291.
73. COLBY, L. S. AND LIBKIN, L. 1997. Tractable iteration mechanisms for bag languages. In F. N. Afrati and P. Kolaitis, Eds., Database TheoryICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings, Volume 1186 of Lecture Notes in Computer Science (Jan. 1997), pp. 461-475. SpringerVerlag.
74. COLMERAUER, A., KANOUI, H., ROUSSEL, P., AND PASSERO, R. 1973. Un système de communication homme-machine en Francais. Technical report, Groupe de Recherche en Intelligence Artificielle, Université d'Aix-Marseille II.
75. CORCIULO, L., GlANXOTTI, F., AND PEDRESCHI, D. 1993. Datalog with non-deterministic choice computes NDB-PTIME. In S. Ceri, K. Tanaka, and S. Tsur, Eds., Deductive and ObjectOriented Databases, Third International Conference, DOOD '93, Phoenix, Arizona, USA, December 6-8, 1993, Proceedings, Volume 760 of Lecture Notes in Computer Science (Dec. 1993), pp. 49-66. Springer-Verlag.
76. COSMADAKIS, S. S. 1989. On the first-order expressibility of recursive queries. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania (PODS '89) (March 1989), pp. 311-323. ACM Press.
77. COSMADAKIS, S. S. AND KANELLAKIS, P. C. 1986. Parallel evaluation of recursive rule queries. In Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 24-26, 1986, Cambridge, Massachusetts (PODS '86) (March 1986), pp. 280-293. ACM Press.
78. COSMADAKIS, S. S. AND KUPER, G. M. 1994. Expressiveness of first-order constraint languages. Technical Report ECRC-94-13, European Computer Industry Research Center.
79. Cox, J. AND McALOON, K. 1993. Decision procedures for constraint-based extensions of datalog. In F. Benharnou and A. Colmerauer, Eds., Constraint Logic Programming, Selected Research, pp. 17-32. The MIT Press.
80. Cox, J., McALOON, K, AND TfiETKOFF, C. 1990. Computational complexity and constraint logic programming languages. In S. K. Debray and M. V. Hermenegildo, Eds., Logic Programming, Proceedings of the 1990 North American Conference, Austin,Texas, October29-Novemberl, 1990 (SLP/NACLP '90) (OctTDec. 1990), pp. 401-415. The MIT Press.
81. DAHLHAUS, E. 1987. Skolem normal forms concerning the least fixpoint. In E. Borger, Ed., Com-pittation Theory and Logic, In Memory of Dieter Podding, Volume 270 of Lecture Notes in Computer Science (1987), pp. 101-106. Springer-Verlag.
82. DANTSIN, E. AND VORO.VKOV, A. 1997. Complexity of query answering in logic databases with complex values. In S. I. Adian and A. Nrode, Eds., Logical Foundations of Computer Science, 4th International Symposium, LFCS '97 Yaroslavl, Russia, July 6-12, 1997, Proceedings, Volume 1234 of Lecture Notes in Computer Science (July 1997), pp. 56-66. Springer-Verlag.
83. DANTSIN, E. AND VORONKOV, A. 1999. A nondeterministic polynomial-time unification algorithm for bags, sets and trees. In W. Thomas, Ed., Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS '99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28,1999, Proceedings, Volume 1578 of Lecture Notes in Computer Science (March 1999), pp. 180-196. Springer-Verlag.
84. DANTSIN, E. AND VORONKOV, A. 2000. Expressive power and data complexity of query languages for trees and lists. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles ofDatabase Systems, May IB-17, 2000, Dallas, Texas, USA (PODS 2000) (May 2000), pp. 157-165. ACM Press.
85. DANTSIN, E., EITER, T., GOTTLOB, G., AND VORONKOV, A. 1997. Complexity and expressive power of logic programming. In Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, June 24-27, 1997, Ulm, Germany, (CCC '97) (June 1997), pp. 82-101. IEEE Computer Society Press.
86. D.wis, M., ED. 1965. The Undecidable: Basic Papers on Undecidable, Unsolvable Problems and Computable Functions. Raven Press, New York.
87. DEGTYAREV, A. AND VORONKOV, A. 1996. A note on semantics of logics programs with equality based on complete sets of .E-unifiers. Journal of Logic Programming 28, 3 (Sept.), 207-216.
88. DEVIENNE, P. 1990. Weighted graphs: A tool for studying the halting problem and time complexity in term rewrite systems and logic programming. Theoretical Computer Science 75, 1&2, 157-215.
89. DEVIENNE, P., LEBèGUE, P., PARRAIN, A., ROUTIER, J.-C., AND WüRTZ, J. 1996. Smallest Horn clause programs. Journal of Logic Programming 27, 3 (June), 227-267.
90. DEVIENNE, P., LEBèGUE, P., AND ROUTIER, J.-C. 1993. Halting problem of one binary Horn clause is undecidable. In P. Enjalbert, A. Finkel, and K W. Wagner, Eds., STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27,1993, Proceedings, Number 665 in Lecture Notes in Computer Science (Feb. 1993), pp. 48-57. SpringerVerlag.
91. DiKOVSKY, A. J. 1993. On the computational complexity of Prolog programs. Theoretical Computer Science 119, 1, 63-102.
92. DK, J., GOTTLOB, G., AND MAREK, V. W. 1996. Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informati. cae 28, 1-2 (Nov.), 87-100.
93. DONG, G., LIBKIN, L., AND WoNG, L. 1997. Local properties of query languages. In F. N. Afrati and P. Kolaitis, Eds., Database Theory-ICDT '97,6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings, Volume 1186 of Lecture Notes in Computer Science (1997), pp. 140-154. Springer-Verlag.
94. DOWLING, W. F. AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfiability of prepositional Horn theories. Journal of Logic Programming 1, 3 (Oct.), 267-284.
95. DUDAKOV, S. 1999. On the complexity of perfect models of logic programs. Fundamenta Informàticae 39, 3 (July-Aug.), 249-258.
96. DWORK, C., KANELLAKIS, P. C., AND MITCHELL, J. C. 1984. On the sequential nature of unification. Journal of Logic Programming 1, 1 (June), 3550.
97. DWORK, C., KANELLAKIS, P. C., AND STOCKMEYER, L. J. 1988. Parallel algorithms for term matching. SIAM Journal on Computing 17, 4 (Aug.), 711-731.
98. EBBINGHAUS, H.-D. AND FLUM, J. 1995. Finite Model Theory. Perspectives in Mathematical Logic. Springer-Verlag.
99. EITER, T. AND GOTTLOB, G. 1992. On the complexity of prepositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence 57, 2-3, 227-270.
100. EITER, T. AND GOTTLOB, G. 1993. Propositional circumscription and extended closed world reasoning are rig-complete. Theoretical Computer Science 114, 2, 231-245. Addendum 118:315.
101. EITER, T. AND GOTTLOB, G. 1995a. The complexity of logic-based abduction. Journal of the Association for Computing Machinery 42,1 (Jan.), 3-42.
102. EITER, T. AND GOTTLOB, G. 1995b. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence IB, 3-4, 289-323.
103. EITER, T. AND GOTTLOB, G. 1997. Expressiveness of stable model semantics for disjunctive logic programs with functions. Journal of Logic Programming 33, 2 (Nov.), 167-178.
104. EITER, T., GOTTLOB, G., AND LEONE, N. 1997a. Abduction from logic programs: Semantics and complexity. Theoretical Computer Science 189, 1-2 (Dec.), 129-177.
105. EITER, T., GOTTLOB, G., AND LEONE, N. 1997b. On the indiscernibility of individuals in logic programming. Journal of Logic and Computation 7, 6 (Dec.), 805-824.
106. EITER, T., GOTTLOB, G., AND MANNILA, H. 1994. Adding disjunction to datalog. In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on. Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota (PODS '94) (May 1994), pp. 267-278. ACM Press.
107. EITER, T., GOTTLOB, G., AND MANNILA.H. 1997c. Disjunctive datalog. ACM Transactions on Database Systems 22, 3 (Sept.), 364-418.
108. EITER, T., GOTTLOB, G., AND VEITH, H. 1997d. Modular logic programming and generalized quantifiers. In J. Dix, U. Furbach, and A. Nerode, Eds., Proceedings of the Fourth International Conference on Logic Programming and NonMonotonie Reasoning, LPNMR '97, Dagstuhl, Germany, July 28-31,1997, Volume 1265 of Lecture Notes in Computer Science (July 1997), pp. 290-309. Springer-Verlag.
109. EITER, T., GOTTLOB, G., AND VEITH, H. 2000. Generalized quantifiers in logic programs. In J. Väänänen, Ed., Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI '97 Workshop, Aix-en-Provence, France, August 11-22,1997, Revised Lectures, Number 1754 in Lecture Notes in Computer Science (2000), pp. 7298. Springer.
110. EITER, T., LEONE, N., AND SACCà, D. 1998a. Expressive power and complexity of partial models for disjunctive deductive databases. Theoretical Computer Science 206, 1-2 (Oct.), 181-218.
111. EITER, T., Lu, J. J., AND SUBRAHMANIAN, V. 1998b. A first-order representation of stable models. The European Journal on Artificial Intelligence (AI Communications) 11, 1, 53-73.
112. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, Ed., Complexity of Computation (1974), pp. 43-74. American Mathematical Society.
113. FALASCHI, M., LEVI, G., PALAMIDESSI, C., AND MARTELLI, M. 1989. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science 69, 3, 289-318.
114. FITTING, M. 1987a. Computability Theory, Semantics, and Logic Programming. Oxford University Press.
115. FITTING, M. 1987b. Enumeration operators and modular logic programming. Journal of Logic Programming 4, 1 (March), 11-21.
116. FLUM, J., KUBIERSCHKY, M., AND LUDäSCHER, B. 1997. Total and partial well-founded datalog coincide. In F. N. Afrati and P. Kolaitis Eds., Database Theory-ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings, Volume 1186 of Lecture Notes in Computer Science (Jan. 1997), pp. 113-124. Springer-Verlag.
117. GAIFMAN, H., MAIRSON, H. G., SAGIV, Y., AXD VARDI, M. Y. 1987. Undecidable optimization problems for database logic programs. In Proceedings of the Symposium on Logic in Computer Science (LICS '87), Ithaca, New York, USA, June 22-25, 1987 (June 1987), pp. 106-115. IEEE Computer Society Press.
118. GALLIER, J. H. AND RAATZ, S. 1986. SLD-resolution methods for Horn clauses with equality based on E-unification. In Proceedings of the 1986 Symposium on Logic Programming, Salt Lake City, Utah, September 22-25, 1986 (SLP '86) (Sept. 1986), pp. 168-179.
119. GALLIER, J. H. AND RAATZ, S. 1989. Extending SLD-resolution to equational Horn clauses using E-unification. Journal of Logic Programming 6, 1&2 (JanTMarch), 3-43.
120. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability. Freeman, San Francisco.
121. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, Eds., Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988 (ICLP/SLP 1988) (Aug. 1988), pp. 1070-1080. The MIT Press.
122. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3-4, 365-386.
123. GIANNOTTI, F. AND PEDREScHi, D. 1998. Datalog with non-deterministic choice computes NDB-PTIME. Journal of Logic Programming 35, 1 (April), 79-110.
124. GIANNOTTI, F., GRECO, S., SACCà, D., AND ZANIOLO, C. 1997. Programming with non-determinism in deductive databases. Annals of Mathematics and Artificial Intelligence 19, 1-2, 97-125.
125. GIVAN, R. AND McALLESTER, D. 2000. Polynomialtime computation via local inference relations, submitted.
126. GOTTLOB, G. 1987. Subsumption and implication. Information Processing Letters 24,2 (Jan.), 109-111.
127. GOTTLOB, G. 1992. Complexity results for nonmonotonic logics. Journal of Logic and Computation 2, 3 (June), 397-425.
128. GOTTLOB, G. AND FERMüLLER, C. G. 1993. Removing redundancy from a clause. Artificial Intelligence 61, 2, 263-289.
129. GOTTLOB, G. AND LEITSCH, A. 1985a. Fast subsumption algorithms. In B. F. Caviness Ed., Proceedings of the European Conference on Computer Algebra (EUROCAL '85) : volume 2: research contributions, Volume 204 of Lecture Notes in Computer Science (Linz, Austria, 1985), pp. 64-77. Springer-Verlag.
130. GOTTLOB, G. AND LEITSCH, A. 1985b. On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery 32, 2 (April), 280-295.
131. GOTTLOB, G. AND PAPADIMITRIOU, C. H. 1999. On the complexity of single-rule datalog queries. In H. Ganzinger, D. A. McAllester, and A. Voronkov, Eds., Logic Programming and Automated Reasoning, 6th International Conference, LPAR '99, Tbilisi, Georgia, September 6-10,1999, Proceedings, Volume 1705 of Lecture Notes in Computer Science (1999), pp. 201-222. Springer-Verlag. Full paper submitted for publication.
132. GOTTLOB, G. AND PICHLER, R. 1999. Working with arms: Complexity results on atomic representations of Herbrand models. In 14th Annual IEEE Symposium on Logic in Computer Science, 2-5 July, 1999, Trento, Italy (L1CS '99) (July 1999), pp. 306-315. IEEE Computer Society Press. Full paper in Information and Computation, to appear.
133. GOTTLOB, G.,GRADEL,E., AND VEITH.H. 2000a. Datalog LITE: A deductive query language with linear time model checking. Manuscript, submitted for publication.
134. GOTTLOB, G., GRäDEL, E., AND VEITH, H. 2000b. Linear time datalog and branching time logic. In J. Minker, Ed., Logic-Based Artificial Intelligence. Kluwer.
135. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1997. On the complexity of some inductive logic programming problems. In N. Lavrac and S. Dzeroski, Eds., Inductive Logic Programming, 7th International Workshop, ILP-97, Prague, Czech Republic, September 17-20,1997, Proceedings, Volume 1297 of LNAI (Berlin, Sept. 1997), pp. 17-32. Springer. Full version: [Gottlob et al. 1999b].
136. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1998. The complexity of acyclic conjunctive queries. In 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Pah Alto, California, USA (Nov. 1998), pp. 706-715. IEEE Computer Society Press.
137. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1999a. Hypertree decompositions and tractable queries. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31-June 2, 1999, Philadelphia, Pennsylvania (May/June 1999), pp. 21-32. ACM Press.
138. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1999b. On the complexity of some inductive logic programming problems. New Generation Computing 17, 1, 53-75.
139. GOTTLOB, G., LEONE, N., AND VEITH, H. 1995. Second order logic and the weak exponential hierarchies. In J. Wiedermann and P. Hajek, Eds., Mathematical Foundations of Computer Science 1995,20th International Symposium, MFCS '95, Prague, Czech Republic, August 28-September 1, 1995, Proceedings, Volume 969 of Lecture Notes in Computer Science (AugVSept. 1995), pp. 6681. Full paper: [Gottlob et al. 1999].
140. GOTTLOB, G., LEONE, N., AND VEITH, H. 1999c. Succinctness as a source of complexity in logical formalisms. Annals of Pure and Applied Logic 97, 1-3 (March), 231-260.
141. GOTTLOB, G., MARCUS, S., NERODE, A., SALZER, G., AND SUBRAHMANIAN, V. 1996. A non-ground realization of the stable and well-founded semantics. Theoretical Computer Science 166, 1&2 (Oct.), 221-262.
142. GRÄDEL, E. 1992. Capturing complexity classes with fragments of second order logic. Theoretical Computer Science 101, 1, 35-57.
143. GRECO, S. AND SACCà, D. 1996. The expressive power of "possible-is-certain" semantics (extended abstract). In J. Jaffar and R. H. C. Yap, Eds., Concurrency and Parallelism, Programming, Networking, and Security: Second Asian Computing Science Conference, ASIAN '96, Singapore, December 2-5, 1996, Proceedings, Volume 1179 of Lecture Notes in Computer Science (1996), pp. 33-42. SpringerVerlag.
144. GRECO, S. AND SACCà, D. 1997. Deterministic semantics for datalog: Complexity and expressive power. In F. Bry, R. Ramakrishnan, and K. Ramamohanaroa, Eds., Deductive and Object-Oriented Databases, 5th International Conference, DOOD '97, Montreux, Switzerland, 'December 8-12,1997, Proceedings, Volume 1341 of Lecture Notes in Computer Science (1997), pp. 337-350. Springer-Verlag.
145. GRECO, S., PALOPOLI, L., AND SPADAFORA, E. 1995. Extending datalog with arrays. Data and Knowledge Engineering 17,1 (Oct.), 31-57.
146. GREEN, C. 1969. The application of theorem proving to question-answering systems. PhD thesis, Computer Science Department, Stanford University.
147. GRIGORYEV, D. AND VOROBJOV, N. 1988. Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation 5, 1/2 (FebVApril), 37-64.
148. GRUMBACH, S. AND LACROK, Z. 1997. On nondeterminism in machines and languages. Annals of Mathematics and Artificial Intelligence 19,1-2, 169-213.
149. GRUMBACH, S. AND Su, J. 1995. First-order definability over constraint databases. In U. Montanari and F. Rossi, Eds., Principles and Practice of Constraint Programming-CP'95, First International Conference, CP'95, Cassis, France, September 19-22, 1995, Proceedings, Volume 976 of Lecture Notes in Computer Science, pp. 121-136. Springer-Verlag.
150. GRUMBACH, S. AND VIANU, V. 1995. Tractable query languages for complex object databases. Journal of Computer and System Sciences 51, 2 (Oct.), 149-167.
151. GRUMBACH, S., Su, J., AND TOLLU, C. 1995. Linear constraint query languages: Expressive power and complexity. In D. Leivant, Ed., Logic and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, Indiana, USA, 13-16 October 1994, Volume 960 of Lecture Notes in Computer Science, pp. 426-446. Springer-Verlag.
152. GUREVICH, Y. 1988. Logic and the challenge of computer science. In E. Borger, Ed., Current Trends in Theoretical Computer Science, Chapter 1, pp. 1-57. Computer Science Press.
153. GUREVTCH, Y. AND SnELAH, S. 1986. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32, 265-280.
154. GYSSENS, M., VAN GUCHT, D., AND Suciu, D. 1995. The restricted and bounded fixpoint closures of the nested relational algebra are equivalent. In P. Atzeni and V. Tannen, Eds., Database Programming Languages (DBPL-5), Proceedings of the Fifth International Workshop on Database Programming Languages, Gubbio, Umbria, Italy, 6-8 September 1995, Electronic Workshops in Computing (1995). Springer-Verlag.
155. HANSCHKE, P. AND WüRTZ, J. 1993. Satisfiability of the smallest binary program. Information Processing Letters 45, 5 (April), 237-241.
156. HANUS, M. 1994. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19/20, 583-628.
157. HERBRAND, J. 1972. Logical Writings. Harvard University Press.
158. HlLLEBRAND, G. G., KANELLAKIS, P. C., MAIRSON, H. G., AND VARDI, M. Y. 1995. Undecidable boundedness problems for datalog programs. Journal of Logic Programming 25, 2 (Nov.), 163-190.
159. HöLLDOBLER, S. 1989. Foundations of Equational Logic Programming, Volume 353 of Lecture Notes in Artificial Intelligence. Springer-Verlag.
160. HULL, R. AND Su, J. 1994. Domain independence and the relational calculus. Acta Informatica 31, 6, 513-524.
161. IERARDI, D. 1989. Quantifier elimination in the theory of an algebraically-closed field. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing (STOC '89) (Seattle, Washington, May 1989), pp. 138-147.
162. IMMERMAN, N. 1986. Relational queries computable in polynomial time. Information and Control 68,1-3 (Jan./Feb./March), 86-104.
163. IMMERMAN, N. 1987. Languages that capture complexity classes. SIAM Journal on Computing 16, 4 (Aug.), 760-778.
164. IMMERMAN, N. 1999. Descriptive Complexity. Graduate Texts in Computer Science. Springer-Verlag, New York.
165. INDUE, K. AND SAKAMA, C. 1993. Transforming abductive logic programs to disjunctive programs. In D. S. Warren, Ed., Logic Programming, Proceedings of the Tenth International Conference on Logic Programming, June 21-25, 1993, Budapest, Hungary (ICLP '93) (June 1993), pp. 335-353. The MIT Press.
166. INOUE, K. AND SAKAMA, C. 1998. Negation as failure in the head. Journal of Logic Programming 35,1 (April), 39-78.
167. IOANNIDIS, Y. E. 1986. A time bound on the materialization of some recursively defined views. Algorithmica 1, 3, 361-385.
168. ITAI, A. AND MAKOWSKY, J. A. 1987. Unification as a complexity measure for logic programming. Journal of Logic Programming 4, 2 (June), 105-117.
169. JAFFAR, J. AMD MäHER, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503-581.
170. JOHNSON, D. S. 1990. A catalog of complexity classes. In J. van Leemven, Ed., Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, Chapter 2, pp. 67-161. Elsevier Science and The MIT Press.
171. JONES, N. D. AND LAASER, W. T. 1976. Complete problems for deterministic polynomial time. Theoretical Computer Science 3,1,105-117.
172. KANELLAKIS, P. C. 1988. Logic programming and parallel complexity. In J. Minker, Ed., Foundations of Deductive Databases and Logic Programming, pp. 547-586. Washington, DC, USA: Morgan Kaufmann.
173. KANELLAKIS, P. C. 1990. Elements of relational database theory. In J. van Leemven, Ed., Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, Chapter 17, pp. 1073-1156. Elsevier Science and The MIT Press.
174. KANELLAKIS, P. C. AND GOLDIN, D. Q. 1994. Constraint programming and database query languages. In M. Hagiya and J. C. Mitchell, Eds., Theoretical Aspects of Computer Software, International Conference TACS '94, Sendai, Japan, April 19-22, 1994, Proceedings, Volume 789 of Lecture Notes in Computer Science (April 1994), pp. 96-120. Springer-Verlag.
175. KANELLAKIS, P. C., KUFER, G. M., AND REVESZ, P. Z. 1990. Constraint query languages. In Proceedings of the Ninth ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee (PODS '90) (April 1990), pp. 299-313. ACM Press.
176. KANELLAKIS, P. C., KUPER, G. M., AND REVESZ, P. Z. 1995. Constraint query languages. Journal of Computer and System Sciences 51, 1 (Aug.), 26-52.
177. KAPUR, D. AND NARENDRAN, P. 1986. NP-completeness of the set unification and matching problems. In J. H. Siekmann, Ed., 8th International Conference on Automated Deduction, Oxford, England, July 27-August 1, 1986, Proceedings (CADE-8), Volume 230 of Lecture Notes in Computer Science (1986), pp. 489-495. Springer-Verlag.
178. KAPUR, D. AND NARENDRAN, P. 1992. Complexity of unification problems with associativecommutative operators. Journal of Automated Reasoning 9, 2 (Oct.), 261-288.
179. KIETZ, J.-U. AND DZEROSKI, S. 1994. Inductive logic programming and learnability. SIGART Bulletin 5, 1 (Jan.), 22-32.
180. KIFER, M. AND Wu, J. 1993. A logic for programming with complex objects. Journal of Computer and System Sciences 47, 1 (Aug.), 77-120.
181. KiFER, M., LAUSEN, G., AND Wu, J. 1995. Logical foundations of object-oriented and frame-based languages. Journal of the Association for Computing Machinery 42, 4 (July), 741-S43.
182. KOLAITIS, P. G. 1991. The expressive power of stratified logic programs. Information and Compulation SO, 1 (Jan.), 50-66.
183. KOLAITIS, P. G. AND PAPADIMITRIOU, G. H. 1991. Why not negation by fixpoint? Journal of Computer and System Sciences 43, 1 (Aug.), 125-144.
184. KOLAITIS, P. G. AND VARDI.M.Y. 1992. Fixpoint logic vs. infinitary logic in finite-model theory. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science (LICS '92) (Santa Cruz, California, 22-25 June 1992), pp. 46-57. IEEE Computer Society Press.
185. KOLAITIS, P. G. AND VARDI, M. Y. 1995. On the expressive power of datalog: Tools and a case study. Journal of Computer and System Sciences 51, 1 (Aug.), 110-134.
186. KOSCIELSKI, A. AND PACHOLSKi, L. 1996. Complexity of Makanin's algorithm. Journal of the Association for Computing Machinery 43,4 (July), 670684.
187. KOWALSKI, R. A. 1974. Predicate logic as programming language. In J. L. Rosenfeld, Ed., Information Processing 74, Proceedings oflFIP Congress 74, Stockholm, Sweden, August 5-10,1974 (1FIP '74) (Amsterdam, Aug. 1974), pp. 569-574. North Holland.
188. KOWALSKI, R. A. AND KUEHNER, D. 1971. Linear resolution with selection function. Artificial Intelligence 2, 3/4, 227-260.
189. LAKSHMANAN, V. AND MENDELZON, A. O. 1989. Inductive pebble games and the expressive power of datalog. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles ofDalabase Systems, March 29-31, 1989, Philadelphia, Pennsylvania (PODS '89) (March 1989), pp. 301-310. ACM Press.
190. LEITSCH, A. 1990. Deciding Horn classes by hyperresolution. In E. Borger, H. Kleine Büning, and M. M. Richter, Eds., CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings, Volume 440 of Lecture Notes in Computer Science (1990), pp. 225-241. Springer-Verlag.
191. LEITSCH, A. 1997. The Resolution Calculus. Springer-Verlag.
192. LEITSCH, A. AND GOTTLOB, G. 1990. Deciding Horn clause implication problems by ordered semantic resolution. In F. Gardin and G. Mauri, Eds., Computational Intelligence II, Proceedings of the International Symposium, Milan, Italy, 2527 Sept. 1989 (Amsterdam, The Netherlands, 1990), pp. 19-26. North Holland.
193. LEIVANT, D. 1989. Descriptive characterizations of computational complexity. Journal of Computer and System Sciences 39, 1 (Aug.), 51-83.
194. LEONE, N., PALOPOLI, L., AND SACCà, D. 1999. On the complexity of search queries. In T. Polie, T. Ripke, and K.-D. Schewe, Eds., Fundamentals of Information Systems, Papers from the Seventh Workshop on Foundations of Models and Languages for Data and Objects, Ostfriesland, Germany, October 5-9, 1998 (FMLDO '98) (1999), pp. 113-127. Kluwer.
195. LEONE, N., RULLO, P., AND SCARCELLO, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics and computation. Information and Computation 135, 2 (June), 69-112.
196. LEWS, H. R. 1979. Unsolvable Classes of Quantificational Formulas. Addison-Wesley, Reading, Mass.
197. LEWIS, H. R. AND STATMAN, R. 1982. Unifiability is complete for co-NLogSpace. Information Processing Letters 15, 5 (Dec.), 220-222.
198. LIBKIN, L. 1997. On the forms of locality over finite models. In Proceedings, 12th Annual IEEE ' Symposium on Logic in Computer Science, Warsaw, Poland, June 29-July 2, 1997 (LICS '97) (June/July 1997), pp. 204-215. IEEE Computer Society Press.
199. LIBKIN, L. AND WONG, L. 1994. New techniques for studying set languages, bag languages and aggregate functions. In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26,1994, Minneapolis, Minnesota (PODS '94) - (May 1994), pp. 155-166. ACM Press.
200. LIBKIN, L. AND WOXG, L. 1995. On representation and querying incomplete information in databases with bags. Information Processing Letters 56, 4 (Nov.), 209-214.
201. LIBKIN, L., MACIILIN, R., AND WONG, L. 1996. A query language for multidimensional arrays: Design, implementation, and optimization techniques. In H. V. Jagadish and I. S. Mumick, Eds., Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 4-6,1996 (June 1996), pp. 228-239. ACM Press.
202. LISITSA, A. AND SAZONOV, V. Y. 1997. Delta-languages for sets and LOGSPACE computable graph transformers. Theoretical Computer Science 175,1 (April), 183-222.
203. LIVCIIAK, A. 1983. The relational model for process control. Automatic Documentation and Mathematical Linguistics 4, 27-29. In Russian.
204. LLOYD, J. W. 1987. Foundations of Logic Programming (2nd edition). Springer-Verlag.
205. LOBO,J.,MINKER, J., AND RAJASEKAR, A. 1992. Foundations ofDisjunctive Logic Programming. Logic Programming Series. MIT Press.
206. LONC, Z. AND TRUSZCZYNSKI, M. 2000. On the problem of computing the well-founded semantics. In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, Eds., Proceedings First International Conference on Computational Logic (CL-2000), Knowledge Representation and Non-Monotonie Reasoning Stream, London, UK, 24-28 July, 2000, Number 1861 in LNCS/LNAI (July 2000), pp. 673-687. Springer-Verlag.
207. MäHER, M. J. 1988. Equivalences of logic programs. In J. Minker, Ed., Foundations of Deductive Databases and Logic Programming, pp. 627-658. Washington, DC, USA: Morgan Kaufmann.
208. MAKANBJ, G. 1977. The problem of solvability of equations in free semigroups. Matematiceskij Sbornik 103, 2, 147-236.
209. In Russian. English Translation in: Math. USSR Sbornik 32, 2, 129-198,1977.
210. MARCINKOWSKI, J. 1996a. The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs. In C. Puech and R. Reischuk, Eds., STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, Volume 1046 of Lecture Notes in Computer Science (Feb. 1996), pp. 427-438. Springer-Verlag.
211. MARCINKOWSKI, J. 1996b. DATALOG SIRUPs uniform boundedness is undecidable. In Proceedings, llth Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, 27-30 July 1996 (LICS '96) (July 1996), pp. 13-24. IEEE Computer Society Press.
212. MARCINKOWSKI, J. 1999. Achilles, turtle, and undecidable boundedness problems for small DATALOG programs. SIAM Journal on Computing 29, 1,231-257.
213. MARCINKOWSKI, J. AND PACHOLSKI, L. 1992. Undecidability of the Horn-clause implication problem. In 33rd Annual Symposium on Foundations of Computer Science (FOCS '92) (Pittsburgh, Pennsylvania, 24-27 Oct. 1992), pp. 354-362. IEEE Computer Society Press.
214. MAREK, V.W. AND TRUSZCZYNSKI.M. 1991. Autoepistemic logic. Journal of the Association for Computing Machinery 38, 3 (July), 588-619.
215. MAREK, V. W., NERODE, A., AND REMMEL, J. B. 1992. How complicated is the set of stable models of a recursive logic program? Annals of Pure and Applied Logic 56, 1-3 (April), 119-135.
216. MAREK, V. W., NERODE, A., AND REMMEL, J. B. 1994. The stable models of a predicate logic program. Journal of Logic Programming 21,3 (Nov.), 129-153.
217. MAREK, V. W., NERODE, A., AND REMMEL, J. B. 1996. On the complexity of abduction. In Proceedings, llth Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, 27-30 July 1996 (LICS '96) (July 1996), pp. 513-522. IEEE Computer Society Press.
218. MAREK, V. W., RAJASEKAR, A., AND TRUSZCZYNSKI, M. 1995. Complexity of computing with extended prepositional logic programs. Annals of Mathematics and Artificial Intelligence 15, 3-4, 357-378.
219. MARKUSZ, Z. AND KAPOSI, A. A. 1982. A design methodology in Prolog programming. In M. van Caneghem, Ed., Proceedings of the First International Logic Programming Conference, September, 14-17th, 1982. Faculté des Science de Luminy, ADDP-GIA, Marseille, France (ICLP '82) (Sept. 1982), pp. 139-145.
220. MARTELLI, A. AND MONTANARI, U. 1976. Unification in linear time and space: A structured presentation. Technical Report B76-16 (Nota Interna), IEI, Consiglio Nazionale delle Ricerche, Pisa, Italy.
221. MARTELLI, A. AND MONTANAKI, U. 1982. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4, 2 (April), 258-282.
222. MATIYASEVIC, Y. V. 1970. Enumerable sets are Diophantine. Doklady Akademii Nauk SSSR 191, 2, 279-282.
223. In Russian. English Translation in: Soviet Mathematical Doklady 11, 354-357, 1970.
224. McALLESTER, D. 1993. Automatic recognition of tractability in inference relations. Journal of the Association for Computing Machinery 40,2,284-303.
225. MINKER, J. 1982. On indefinite data bases and the closed world assumption. In D. \V. Loveland, Ed., 6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings, Number 138 in Lecture Notes in Computer Science (June 1982), pp. 292-308. Springer-Verlag.
226. MINKER, J., ED. 1988. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Washington, DC.
227. MINKER, J. 1994. Overview of disjunctive logic programming. Annals of Mathematics and Artificial Intelligence 12, 1,2 (Dec.), 1-24.
228. MINKER, J. 1996. Logic and databases: A 20 year retrospective. In Logic in Databases, International Workshop LID '96, San Miniato, Italy, July 1-2,1996, Proceedings, Volume 1154 of Lecture Notes in Computer Science (1996), pp. 3-57. Springer.
229. MINKER, J. AND NICOLAS, J.-M. 1983. On recursive axioms in deductive databases. Information Systems 8, 1, 1-13.
230. MINKER, J. AND Ruiz, C. 1994. Semantics for disjunctive logic programming with explicit and default negation. Fundamenta Informaticae 20, 1/2/3 (March/April/May), 145-192.
231. MUGGLETON, S. 1992. Inductive logic programming. In S. Muggleton, Ed., Inductive Logic Programming, pp. 3-28. Academic Press.
232. NARENDRAN, P. AND OTTO, F. 1990. Some results on equational unification. In M. E. Stickel, Ed., 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27,1990, Proceedings, Volume 449 of Lecture Notes in Computer Science (July 1990), pp. 276-291. Springer-Verlag.
233. NAUGHTON, J. F. 1989. Data independent recursion in deductive databases. Journal of Computer and System Sciences 38, 2 (April), 259-289.
234. NAUGHTON, J. F. AND SAGIV, Y. 1987. A decidable class of bounded recursions. In Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California (PODS '87) (March 1987), pp. 227-236. ACM Press.
235. NAUGHTON, J. F. AND SAGIV, Y. 1991. A simple characterization of uniform boundedness for a class of recursions. Journal of Logic Programming 10, 1/2/3&4 (Jan.), 233-253.
236. OCHOZKA, V, ŠTěPáNKOVá, O., AND ŠTěPáNEK, P. 1988. Normal forms and the complexity of computations of logic programs. In E. Borger, H. Kleine Büning, and M. M. Richter, Eds., CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3~7, 1988, Proceedings, Volume 385 of Lecture Notes in Computer Science, pp. 357-371. Springer-Verlag.
237. OTTO.M.ANDVANDENBUSSCHE, J. 1996. First-order queries on databases embedded in an infinite structure. Information Processing Letters 60, 1 (Oct.), 37-41.
238. PALOPOLI, L. 1992. Testing logic programs for local stratification. Theoretical Computer Science 103, 2, 205-234.
239. PAPADLMITRIOU, C. H. 1985. A note on the expressive power of Prolog. Bulletin of the EATCS 26, 2123.
240. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley.
241. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1986. A note on succinct representations of graphs. Information and Control 71, 3 (Dec.), 181-185.
242. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1997. On the complexity of database queries. In Proceedings of the Sixteenth ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, May 12-14, 1997, Tucson, Arizona (PODS '97) (May 1997), pp. 12-19. ACM Press.
243. PAREDAENS, J. AND VAN GUCHT, D. 1992. Converting nested algebra expressions into flat algebra expressions. ACM Transactions on Database Systems 17,1 (March), 65-93.
244. PAREDAENS, J., VAN DEN BUSSCHE, J., AND VAN GUCHT, D. 1998. First-order queries on finite structures over the reals. SIAM Journal on Computing27,6 (Dec.), 1747-1763.
245. PATERSON, M. S. AND WEGMAN, M. N. 1978. Linear unification. Journal of Computer and System Sciences 16, 2 (April), 158-167.
246. PEARCE, D. AND WAGNER, G. 1991. Logic programming with strong negation. In P. Schroeder-Heister, Ed., Extensions of Logic Programming, International Workshop, Tübingen, FRG, December 8-10, 1989, Proceedings (ELP '89), Number 475 in LNCS (1991), pp. 311-326. Springer.
247. POLLETT, C. AND REM.MEL, J. 1997. Nonmonotonic reasoning with quantified Boolean constraints. In J. Dix, U. Furbach, and A. Nerode, Eds., Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonie Reasoning, LPNMR '97, Dagstuhl, Germany, July 28-31, 1997, Volume 1265 of Lecture Notes in Computer Science (July 1997), pp. 18-39. Springer-Verlag.
248. PRZYMUSINSKI, T. C. 1988a. On the declarative semantics of deductive databases and logic programs. In J. Minker, Ed., Foundations of Deductive Databases and Logic- Programming, pp. 193-216. Washington, DC, USA: Morgan Kaufmann.
249. PRZYMUSINSKI, T. C. 1988b. Perfect model semantics. In R. A. Kowalski and K. A. Bowen, Eds., Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988 (ICLP/SLP '88) (Aug. 1988), pp. 1081-1096. MIT Press.
250. PRZYMUSINSKI, T. C. 1991. Stable semantics for dis.junctive programs. New Generation Computing9, 3/4, 401-424.
251. PRZYMUSINSKI, T. C. 1995. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 14, 2-4 (Sept.), 323-357.
252. RENEGAR.J. 1988. A faster PSPACE algorithm for deciding the existential theory of the reals. In 29th Annual Symposium on Foundations of Computer Science (White Plains, New York, 24-26 Oct. 1988), pp. 291-295. IEEE.
253. ROBINSON, J. 1965. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery 12, 1 (Jan.), 23-41.
254. ROSATI, R. 1997. Reasoning with minimal belief and negation as failure: Algorithms and complexity. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI97, IAAI97, July 27-31,1997, Providence, Rhode Island (July 1997), pp. 430-435. AAAI Press/MIT Press.
255. ROSATI, R. 1998. Expressiveness vs. complexity in nonmonotonic knowledge bases: Propositional case. In H: Prade, Ed., 13th European Conference on Artificial Intelligence, Brighton, UK, August 23-281998, Proceedings (ECAI '98) (Chichester, Aug. 1998), pp. 47-48.
256. SACCà, D. 1995. Deterministic and nondeterministic stable model semantics for unbound DATALOG queries. In G. Gottlob and M. Y. Vardi, Eds., Database Theory-ICDT '95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings, Volume 893 of Lecture Notes in Computer Science (Jan. 1995), pp. 353-367. Springer-Verlag.
257. SACCà, D. 1997. The expressive powers of stable models for bound and .unbound DATALOG queries. Journal of Computer and System Sciences 54, 3 (June), 441-464.
258. SAGIV, Y. 1985. On computing restricted projections of representative instances. In Proceedings of the Fourth ACM SIGACT-SIGMOD Sym-posium on Principles of Database Systems, March 25-27, 1985, Portland, Oregon (PODS '85) (March 1985), pp. 171-180. ACM Press.
259. SAGPV, Y. 1988. Optimizing datalog programs. In J. Minker, Ed., Foundations of Deductive Databases and Logic Programming, pp. 659-698. Washington, DC, USA: Morgan Kaufmann.
260. SAGIV, Y. AND YANNAKAKIS, M. 1980. Equivalence among relational expressions with the union and difference operators. Journal of the Association for Computing Machinery 27, 4 (Oct.), 633-655.
261. SAKAMA, C. AND INOUE, K. 1994a. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning 13, 1,145-172.
262. SAKAMA, C. AND INOUE, K. 1994b. On the equivalence between disjunctive and abductive logic programs. In P. van Hentenryck, Ed., Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, June 13-18,1994, Santa Marherita Ligure, Italy (/CLP '94) (June 1994), pp. 489-503. The MIT Press.
263. SAVITCH, W. J. 1970. Relationship between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 2 (April), 177-192.
264. SAZONOV, V. Y. 1993. Hereditarily-finite sets, data bases and polynomial-time computability. Theoretical Computer Science 119,1,187-214.
265. SAZONOV, V. Y. AND LISITSA, A. 1995. Deltalanguages for. sets and sub-PTIME graph transformers. In G. Gottlob and M. Y. Vardi, Eds., Database Theory-ICDT '95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings, Volume 893 of Lecture Notes in Computer Science (1995), pp. 125-138. Springer-Verlag.
266. SCHLIPF, J. S. 1990. The expressive powers of the logic programming semantics. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4,1990, Nashville, Tennessee (PODS '90) (April 1990), pp. 196-204. ACM Press.
267. SCHLIPF, J. S. 1995a. Complexity and undecidability results for logic programming. Annals of Mathematics and Artificial Intelligence 15, 3-A, 257-288.
268. SCHLIPF, J. S. 1995b. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences 51, 1, 64-86. Abstract: [Schlipf 1990].
269. SCHOLZ, H. AND HASENJAEGER, G. 1961. Grundzüge der mathematischen Logik. Springer, Berlin.
270. SEBELíK, J. AND STëPANEK, P. 1982. Horn clause programs for recursive functions. In K. L.Clark and S.-A. Tarnlund, Eds., Logic Programming, pp. 325-340. Academic Press.
271. SEITZER, J. AND SCHLIPF, J. 1997. Affordable classes of normal logic programs. In J. Dix, U. Furbach, and A. Nerode, Eds., Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonie Reasoning, LP-NMR '97, Dagstuhl, Germany, July 28-31,1997, Volume 1265 of Lecture Notes in Computer Science (July 1997), pp. 18-39. Springer-Verlag.
272. SHAPIRO, E. Y. 1984. Alternation and the computational complexity of logic programs. Journal of Logic Programming 1, 1 (June), 19-33.
273. SHMUELI, O. 1987. Decidability and expressiveness aspects of logic queries. In Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 23-25, 1987, San Diego, California (PODS '87) (March 1987), pp. 237-249. ACM Press.
274. SMULLYAN, R. 1961. Theory of Formal Systems. Princeton University Press, Princeton, New Jersey. Annals of Mathematical Studies Vol 47.
275. SMULLYAN, R. M. 1956. On definability by recursion (Abstract 782t). Bulletin AMS 62, 601.
276. ŠTěPANEK, P. AND ŠŤPáNKOVá, O. 1986. Logic programs and alternation. In E. Y. Shapiro, Ed., Third International Conference on Logic Programming, Imperial College of Science and Technology, London, United Kingdom, July 14-18,1986, Proceedings (ICLP '86), Number 225 in Lecture Notes in Computer Science, pp. 99-106. Springer-Verlag.
277. ŠTěPáNKOVá, O. AND ŠTěPáNEK, P. 1984. Transformations of logic programs. Journal of Logic Programming 1, 4 (Dec.), 305-318.
278. Suciu,D. 1997. Fixpoints for complex objects. Theoretical Computer Science 176,1-2 (April), 283-328.
279. TäRNLUND, S.-Å. 1977. Horn clause computability. BIT 17, 2, 215-226.
280. TURING, A. M. 1936-1937. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society Series 2, 42, 230-265. Corrections ibid. 544-546. Reprinted in [Davis 1965].
281. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, New York, N.Y.
282. ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press, New York, N.Y.
283. ULLMAN, J. D. AND VAN GELDER, A. 1988. Parallel complexity of logical query programs. Algorithmica 3, 5-42.
284. VADAPARTY, K. V. 1991. On the power of rule-based languages with sets. In Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 29-31, 1991, Denver, Colorado (PODS '91) (May 1991), pp. 26-36. ACM Press.
285. VAN DER MEYDEN, R. 1992. The complexity of querying indefinite data about linearly ordered domains. In Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2-4, 1992, San Diego, California (PODS '92) (June 1992), pp. 331-345. ACM Press.
286. VAN DER MEYDEN, R. 1997. The complexity of querying indefinite data about linearly ordered domains. Journal of Computer and System Sciences 54, 1 (Feb.), 113-135. Abstract: [van der Meyden 1992].
287. VAN EMDEN, M. H. AND KOWALSKI, R. A. 1976. The semantics of predicate logic as a programming language. Journal of the Association for Computing Machinery 23, 4 (Oct.), 733-742.
288. VAN GELDER, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31,1989, Philadelphia, Pennsylvania (PODS '89) (March 1989), pp. 1-10. ACM Press.
289. VAN GELDER, A., ROSS, K. A., AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the Association for Computing Machinery 38, 3 (July), 620-650.
290. VAN LEEUWEN, J. Ed. 1990. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics. Elsevier Science and The MIT Press.
291. VANDEURZEN, L., GYSSENS, M., AND VAN GUCHT, D. 1996. On query languages for linear queries definable with polynomial constraints. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, Massachusetts, USA, August 19-22, 1996, Number 1118 in Lecture Notes in Computer Science (Aug. 1996), pp. 468-481.
292. VARDI, M. Y. 1982. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC '82) (San Francisco, California, 5-7 May 1982), pp. 137-146.
293. VARDI, M. Y. 1988. Decidability and undecidability results for boundedness of linear recursive queries. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles ofDatabase Systems, March 21-23, 1988, Austin, Texas (PODS '88) (March 1988), pp. 341-351. ACM Press.
294. VARDI, M. Y. 1995. On the complexity of boundedvariable queries. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles ofDatabase Systems, May 22-25, 1995, San Jose, California (PODS '95) (May 1995), pp. 266-276. ACM Press.
295. VEITH, H. 1994. Logical reducibilities in finite model theory. Master's thesis, Information Systems Department, TU Vienna, Austria.
296. VEITH, H. 1998. Succinct representation, leaf languages, and projection reductions. Information and Computation 142, 2 (May), 207-236.
297. VIANU, V. 1997. Rule-based languages. Annals of Mathematics and Artificial Intelligence 19, 1-2, 215-259.
298. VOROBYOV, S. G. AND VoRONKOv, A. 1998. Complexity of nonrecursive logic programs with complex values. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington (PODS '98) (June 1998), pp. 244-253. ACM Press.
299. VORONKOV, A. 1995. On computability by logic programs. Annals of Mathematics and Artificial Intelligence 15, 3-4, 437-456.
300. WONG, L. 1996. Normal forms and conservative extension properties for query languages over collection types. Journal of Computer and System Sciences 52, 3 (June), 495-505.
301. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings (VLDB '81) (Sept. 1981), pp. 82-94. IEEE Computer Society Press.
302. YASUURA, H. 1984. On parallel computational complexity of unification. In Fifth Generation Computer Systems 1984, Proceedings of the International Conference on Fifth Generation Computer Systems 1984, Tokyo, Japan, November 6-9, 1984 (FGCS '84) (1984), pp. 235-243. Institute for New Generation Computer Technology (ICOT): OHMSHA and North-Holland.
303. You, J.-H. AND YUAN, L.-Y. 1995. On the equivalence of semantics for normal logic programming. Journal of Logic Programming 22, 3 (March), 211-222.