Georg Gottlob
Thomas Schwentick
Abstract
Fagin's theorem, the first important result of descriptive complexity, asserts that a property of graphs is in NP if and only if it is definable by an existential second-order formula. In this article, we study the complexity of evaluating existential second-order formulas that belong to prefix classses of existential second-order logic, where a prefix class is the collection of all existential second-order formulas in prenex normal form such that the second-order and the first-order quantifiers obey a certain quantifier pattern. We completely characterize the computational complexity of prefix classes of existential second-order logic in three different contexts: (1) over directed graphs, (2) over undirected graphs with self-loops and (3) over undirected graphs without self-loops. Our main result is that in each of these three contexts a dichotomy holds, that is to say, each prefix class of existential second-order logic either contains sentences that can express NP-complete problems, or each of its sentences expresses a polynomial-time solvable problem. Although the boundary of the dichotomy coincides for the first two cases, it changes, as one moves to undirected graphs without self-loops. The key difference is that a certain prefix class, based on the well-known Ackermann class of first-order logic, contains sentences that can express NP-complete problems over graphs of the first two types, but becomes tractable over undirected graphs without self-loops. Moreover, establishing the dichotomy over undirected graphs without self-loops turns out to be a technically challenging problem that requires the use of sophisticated machinery from graph theory and combinatorics, including results about graphs of bounded tree-width and Ramsey's theorem.
- Bodlaender, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305--1317. Google Scholar
Digital Library
- Börger, E., Grädel, E., and Gurevich, Y. 1997. The Classical Decision Problem. Springer, Berlin, Germany.Google Scholar
- Büchi, J. R. 1960. Weak second-order arithmetic and finite automata. Z. Math. Logik Grund. Math. 6, 66--92.Google ScholarCross Ref
- Courcelle, B. 1990. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inf. Comput. 85, 12--75. Google ScholarDigital Library
- Downey, R. G., and Fellows, M. R. 1999. Parametrized Complexity. Springer-Verlag, New York. Google ScholarDigital Library
- Eiter, Th., Gottlob, G., and Gurevich, Y. 2000. Existential second order logic over strings. J. ACM 47, 1, 77--131. (Preliminary version in LICS'98.) Google ScholarDigital Library
- Eiter, Th., Gottlob, G., and Schwentick, Th. 2002. Second order logic over strings: Regular and nonregular fragments. In Proceedings of the 5th International Conference on Developments in Language Theory (Vienna, Austria, July 16--21, 2001). Lecture Notes in Computer Science, vol. 2295. Springer-Verlag, New York, pp. 21--36. Google ScholarDigital Library
- Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, R. M. Karp, ed. AMS, providence, R.F., pp. 43--74.Google Scholar
- Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York. Google ScholarDigital Library
- Grädel, E. 1991. The Expressive power of second-order Horn Logic. In Proceedings STACS-91. Lecture Notes in Computer Science, vol. 480. Springer-Verlag, New York, pp. 466--477. Google ScholarDigital Library
- Grädel, E. 1992. Capturing complexity classes with fragments of second order logic. Theoret. Comput. Sci. 101, 35--57. Google ScholarDigital Library
- Immerman, N. 1988. Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935--939. Google ScholarDigital Library
- Immerman, N. 1998. Descriptive Complexity Theory. Springer-Verlag, New York, 1999.Google Scholar
- Jones, N. D., Lien, Y. E., and Laaser, W. T. 1976. New problems complete for nondeterministic log space. Math. Syst. Theory 10, 1--17.Google ScholarCross Ref
- Ladner, R. 1975. On the structure of polynomial time reducibility. J. ACM 22, 155--171. Google ScholarDigital Library
- Papadimitriou, C. H. 1994. Computational Complexity, Addison-Wesley, Reading, Pa.Google Scholar
- Papadimitriou, C. H., and Yannakakis, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425--440.Google ScholarCross Ref
- Robertson, N., and Seymour, P. D. 1986. Graph minors II. Algorithmic aspects of tree-width. J. Algorithms 7, 309--322.Google ScholarCross Ref
- Robertson, N., and Seymour, P. D. 1984. Graph minors III. Planar tree-width. J. Combinat. Theory, Ser. B 36, 49--64.Google ScholarCross Ref
- Szelepcsènyi, R. 1988. The method of forced enumeration for nondeterministic automata. Acta Inf., 26, 279--284. Google ScholarDigital Library
- Tarjan, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146--160.Google ScholarDigital Library
- Thomassen, C. 1988. On the presence of disjoint subgraphs of a specified type. Algorithmic aspects of tree-width. J. Graph Theory 12, 1, 101--111.Google ScholarCross Ref
- Trahtenbrot, B. 1963. The impossibility of an algorithm for the decision problem for finite domains (Russian). Doklady Academii Nauk SSR, 70:569--572, 1950. English translation: American Mathematical Society Translation Series 2, 23, 1--5.Google Scholar
- Wanke, E. 1994. Bounded tree-width and LOGCFL. J. Algorithms 16, 470--491. Google ScholarDigital Library
Index Terms
- Existential second-order logic over graphs: Charting the tractability frontier
Recommendations
Existential second-order logic over strings
Existential second-order logic (ESO) and monadic second-order logic(MSO) have attracted much interest in logic and computer science. ESO is a much expressive logic over successor structures than MSO. However, little was known about the relationship ...
Existential second-order logic over graphs: charting the tractability frontier
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceFagin's (1974) theorem, the first important result of descriptive complexity, asserts that a property of graphs is in NP if and only if it is definable by an existential second-order formula. We study the complexity of evaluating existential second-...
Existential second-order logic and modal logic with quantified accessibility relations
This article investigates the role of arity of second-order quantifiers in existential second-order logic, also known as Σ 1 1 . We identify fragments L of Σ 1 1 where second-order quantification of relations of arity k 1 is (nontrivially) vacuous in ...
Comments