The quest for a logic capturing PTIME

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 267-271

  Grohe, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC IN COMPUTER SCIENCE; OPEN PROBLEMS; POLYNOMIAL-TIME;

COMPUTER NETWORKS; COMPUTER SCIENCE; GRAPH THEORY; POLYNOMIALS;

POLYNOMIAL APPROXIMATION;

EID: 51549116130     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.11     Document Type: Conference Paper

References (49)

1. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62-124, 1991.
2. A. Aho and J. Ullman. The universality of data retrieval languages. In Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, pages 110-120, 1979.
3. A. Atserias, A. Bulatov, and A. Dawar. Affine systems of equations and counting infinitary logic. In L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki, editors, Proceedings of the 34th International Colloquium on Automata, Languages and Programming, volume 4596 of Lecture Notes in Computer Science, pages 558-570. Springer-Verlag. 2007.
4. L. Babai and E. Luks. Canonical labeling of graphs. In Proceedings of the 15 th ACM Symposium on Theory of Computing, pages 171-183, 1983.
5. A. Blass, Y. Gurevich, and S. Shelah. Choiceless polynomial time. Annals of Pure and Applied Logic, 100:141-187, 1999.
6. A. Blass, Y. Gurevich, and S. Shelah. On polynomial time computation over unordered structures. Journal of Symbolic Logic, 67:1093-1125, 2002.
7. H. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11:631-643, 1990.
8. J. Cai, M. Fürer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12:389-410, 1992.
9. A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99-128, 1982.
10. B. Courcelle and S. Olariu. Upper bounds to the cliquewidth of graphs. Discrete Applied Mathematics, 101:77-114, 2000.
11. A. Dawar. Generalized quantifiers and logical reducibilities. Journal of Logic and Computation, 5:213-226, 1995.
12. A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 1994.
13. A. Dawar and D. Richerby. A fixed-point logic with symmetric choice. In M. Baaz and J. Makowsky, editors, Proceedings of the 17th International Workshop on Computer Science Logic, volume 2803 of Lecture Notes in Computer Science, pages 169-182. Springer-Verlag, 2003.
14. A. Dawar, D. Richerby, and B. Rossman. Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Annals of Pure and Applied Logic, 152:31-50, 2008.
15. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 2nd edition, 1999.
16. S. Evdokimov, M. Karpinski, and I. Ponomarenko. On anew high dimensional Weisfeiler-Lehman algorithm. Journal of Algebraic Combinatorics, 10:29-45, 1999.
17. S. Evdokimov and I. Ponomarenko. On highly closed cellular algebras and highly closed isomorphism. Electronic Journal of Combinatorics, 6:#R18, 1999.
18. R. Fagin. Generalized first-order spectra and polynomialtime recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43-73, 1974.
19. I. S. Filotti and J. N. Mayer. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 236-243, 1980.
20. F. Gire and H. Hoang. An extension of fixpoint logic with a symmetry-based choice construct. Information and Computation, 144:40-65, 1998.
21. E. Grädel, P. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Vardi, Y. Venema, and S. Weinstein. Finite Model Theory and Its Applications. Springer-Verlag, 2007.
22. E. Grädel and M. Otto. On Logics with Two Variables. Theoretical Computer Science, 224:73-113, 1999.
23. M. Grohe. Fixed-point logics on planar graphs. In Proceedings of the 13th IEEE Symposium on Logic in Computer Science, pages 6-15, 1998.
24. M. Grohe. Isomorphism testing for embeddable graphs through definability. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 63-72, 2000.
25. M. Grohe. Definable tree decompositions. In Proceedings of the 23 rd IEEE Symposium on Logic in Computer Science, 2008. These proceedings.
26. M. Grohe and J. Mariño. Definability and descriptive complexity on databases of bounded tree-width. In C. Beeri and P. Buneman, editors, Proceedings of the 7th International Conference on Database Theory, volume 1540 of Lecture Notes in Computer Science, pages 70-82. Springer-Verlag, 1999.
27. M. Grohe and O. Verbitzky. Testing graph isomorphism in parallel by playing a game. In M. Bugliesi, B. Preneel, V Sassone, and I. Wegener, editors, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, Part I, volume 4051 of Lecture Notes in Computer Science, pages 3-14. Springer-Verlag, 2006.
28. Y. Gurevich. Logic and the challenge of computer science. In E. Börger, editor, Current trends in theoretical computer science, pages 1-57. Computer Science Press, 1988.
29. L. Hella. Definability hierarchies of generalized quantifiers. Annals of Pure and Applied Logic, 43:235-271, 1989.
30. L. Hella, P. Kolaitis, and K. Luosto. Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic, 2:422-443, 1996.
31. L. Hella, P. Kolaitis, and K. Luosto. How to define a linear order on finite models. Annals of Pure and Applied Logic, 87:241-267, 1997.
32. J. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proceedings of the 6th ACM Symposium on Theory of Computing, pages 172-184, 1974.
33. J. E. Hopcroft and R. Tarjan. Isomorphism of planar graphs (working paper). In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations. Plenum Press, 1972.
34. N. Immemnan. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76-98, 1982.
35. N. Immerman. Expressibility as a complexity measure: results and directions. In Proceedings of the 2nd IEEE Symposium on Structure in Complexity Theory, pages 194-202, 1987.
36. N. Immerman. Descriptive Complexity. Springer-Verlag, 1999.
37. N. Immerman and E. Lander. Describing graphs: A firstorder approach to graph canonization. In A. Selman, editor, Complexity theory retrospective, pages 59-81. Springer-Verlag, 1990.
38. J. Kobler. On graph isomorphism for restricted graph classes. In A. Beckmann, U. Berger, B. Löwe, and J. Tucker, editors, Logical Approaches to Computational Barriers, Proceedings of the Second Conference on Computability in Europe, volume 3988 of Lecture Notes in Computer Science, pages 241-256. Springer-Verlag, 2006.
39. J. Köbler and O. Verbitsky. From invariants to canonization in parallel. CoRR, abs/cs/0608074, 2006. http://arxiv.org/abs/cs/0608074.
40. L. Libkin. Elements of Finite Model Theory. Springer-Verlag, 2004.
41. E. Luks. Isomorphism of graphs of bounded valance can be tested in polynomial time. Journal of Computer and System Sciences, 25:42-65, 1982.
42. G. L. Miller. Isomorphism testing for graphs of bounded genus. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 225-235, 1980.
43. A. Nash, J. B. Remmel, and V Vianu. PTIME queries revisited. In T. Eiter and L. Libkin, editors, Proceedings of the 10th International Conference on Database Theory, volume 3363 of Lecture Notes in Compute/Science, pages 274-288. Springer-Verlag, 2005.
44. M. Otto. Bounded variable logics and counting - A study in finite models, volume 9 of Lecture Notes in Logic. Springer-Verlag, 1997.
45. M. Otto. Canonization for two variables and puzzles on the square. Annals of Pure and Applied Logic, 85:243-282, 1997.
46. M. Otto. Bisimulation-invariant PTIME and higherdimensional μ-calculus. Theoretical Computer Science, 224:237-265, 1999.
47. S.-I. Oum and P. Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B, 96:514-528,2006.
48. M. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137-146, 1982.
49. O. Verbitsky. Planar graphs: Logical complexity and parallel isomorphism tests. In W. Thomas and P. Weil, editors, Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, volume 4393 of Lecture Notes in Computer Science, pages 682-693. Springer-Verlag, 2007.