Counting and locality over finite structures a survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1754, Issue , 1999, Pages 18-50

  Libkin, Leonid ^a   Nurmonen, Juha ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CHARACTERIZATION; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; GAME THEORY; RECONFIGURABLE HARDWARE; SURVEYS;

AGGREGATE FUNCTION; COUNTING QUANTIFIERS; FINITE STRUCTURES; FIRST ORDER LOGIC; FIXPOINT COMPUTATIONS; GENERALIZED QUANTIFIERS; LOGICAL CHARACTERIZATION; RELATIONAL CALCULUS;

COMPUTER CIRCUITS;

EID: 84958974358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46583-9_2     Document Type: Conference Paper

References (49)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases, Addison Wesley, 1995.
2. S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences 50 (1995), 309-335.
3. M. Agrawal, E. Allender and S. Datta. On TC0, AC0, and arithmetic circuits. In Proc. 12th IEEE Conf. on Computational Complexity, 1997.
4. E. Allender. Circuit complexity before the dawn of the new millennium. In Proc. 16th Conf. on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'96), Springer LNCS vol. 1180, 1996, 1-18.
5. D.A. Barrington, N. Immerman and H. Straubing. On uniformity within NC1. J. Comput. and Syst. Sci., 41:274-306,1990.
6. M. Benedikt, H.J. Keisler. On expressive power of unary counters. Proc. Intl. Conf. on Database Theory (ICDT'97), Springer LNCS 1186, January 1997.
7. M. Benedikt and L. Libkin. Relational queries over interpreted structures. J. ACM, to appear. Extended abstract in PODS'97, pages 87-98.
8. R.B. Boppana and M. Sipser. The Complexity of Finite Functions. In Handbook of Theoretical Computer Science, Volume A, Chapter 14, pages 759-804, North Holland, 1990.
9. J. Cai, M. Fürer and N. Immerman. On optimal lower bound on the number of variables for graph identification. Combinatorica, 12 (1992), 389-410.
10. M. Consens and A. Mendelzon. Low complexity aggregation in GraphLog and Datalog, Theoretical Computer Science 116 (1993), 95-116. Extended abstract in ICDT'90.
11. G. Dong, L. Libkin and L. Wong. Local properties of query languages. Theoretical Computer Science, to appear. Extended abstract in ICDT'97, LNCS vol. 1186, pages 140-154.
12. H.-D. Ebbinghaus. Extended logics: the general framework. In J. Barwise and S. Feferman, editors, Model-Theoretic Logics, Springer-Verlag, 1985, pages 25-76.
13. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
14. K. Etessami. Counting quantifiers, successor relations, and logarithmic space, In Proc. Structure in Complexity Theory, 1995.
15. K. Etessami. Counting quantifiers, successor relations, and logarithmic space, Journal of Computer and System Sciences, 54 (1997), 400-411.
16. R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997.
17. R. Fagin, L. Stockmeyer and M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78-92.
18. H. Gaifman. On local and non-local properties, Proceedings of the Herbrand Symposium, Logic Colloquium '81, North Holland, 1982.
19. M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. In MFCS'98, pages 437-445.
20. S Grumbach and T. Milo. Towards tractable algebras for bags. Journal of Computer and System Sciences, 52 (1996), 570-588.
21. S. Grumbach, L. Libkin, T. Milo and L. Wong. Query languages for bags: expressive power and complexity. SIGACT News, 27 (1996), 30-37.
22. W. Hanf. Model-theoretic methods in the study of elementary logic. In J.W. Addison et al, eds, The Theory of Models, North Holland, 1965, pages 132-145.
23. L. Hella. Logical hierarchies in PTIME. Information and Computation, 129 (1996), 1-19.
24. L. Hella, L. Libkin and J. Nurmonen. Notions of locality and their logical characterizations over finite models. Journal of Symbolic Logic, to appear.
25. L. Hella, L. Libkin, J. Nurmonen and L. Wong. Logics with aggregate operators. In Proc. 14th IEEE Symp. on Logic in Computer Science (LICS'99), Trento, Italy, July 1999, pages 35-44.
26. L. Hella and J. Nurmonen. Vectorization hierarchies of some graph quantifiers. Archive for Mathematical Logic, to appear.
27. L. Hella and G. Sandu. Partially ordered connectives and finite graphs. In M. Krynicki, M. Mostowski and L. Szczerba, eds, Quantifiers: Logics, Models and Computation II, Kluwer Academic Publishers, 1995, pages 79-88.
28. N. Immerman. Descriptive Complexity. Springer-Varlag, 1999.
29. N. Immerman. Languages that capture complexity classes. SIAM J. Comput. 16 (1987), 760-778.
30. N. Immerman and E. Lander. Describing graphs: A first order approach to graph canonization. In Complexity Theory Retrospective, Springer Verlag, Berlin, 1990.
31. Ph. Kolaitis and J. Väänänen. Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic, 74 (1995), 23-75.
32. L. Libkin. On the forms of locality over finite models. In Proc. 12th IEEE Symp. on Logic in Computer Science (LICS’97), Warsaw, Poland, June-July 1997, pages 204-215.
33. L. Libkin. On counting logics and local properties. In Proc. 13th IEEE Symp. on Logic in Computer Science (LICS'98), Indianapolis, June 1998, pages 501-512.
34. L. Libkin. Logics with counting, auxiliary relations, and lower bounds for invariant queries. In Proc. 14th IEEE Symp. on Logic in Computer Science (LICS'99), Trento, Italy, July 1999, pages 316-325.
35. L. Libkin and L. Wong. Some properties of query languages for bags. In Proc. Database Programming Languages 1993, Springer Verlag, 1994, pages 97-114.
36. L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences 55 (1997), 241-272. Extended abstract in PODS'94, pages 155-166.
37. L. Libkin and L. Wong. On the power of aggregation in relational query languages. In Proc. Database Programming Languages 1997, Springer LNCS 1369, pages 260-280.
38. L. Libkin and L. Wong. Unary quantifiers, transitive closure, and relations of large degree. In Proc. 15th Symp. on Theoretical Aspects of Computer Science (STACS'98), Springer LNCS 1373, pages 183-193.
39. K. Luosto. Hierarchies of monadic generalized quantifiers. Journal of Symbolic Logic, to appear.
40. J. Nurmonen. On winning strategies with unary quantifiers. J. Logic and Computation, 6 (1996), 779-798.
41. J. Nurmonen. Counting modulo quantifiers on finite structures. Information and Computation, to appear. Extended abstract in Proc. 11th IEEE Symp. on Logic in Computer Science (LICS'96), New Brunswick, NJ, July 1996, pages 484-493.
42. J. Nurmonen. Unary quantifiers and finite structures. PhD Thesis, University of Helsinki, 1996.
43. P. O'Neil. Database. Morgan Kaufmann, 1994.
44. I. Parberry and G. Schnitger. Parallel computation and threshold functions. Journal of Computer and System Sciences 36 (1988), 278-302.
45. A. Razborov and S. Rudich. Natural proofs. Journal of Computer and System Sciences 55 (1997), 24-35.
46. T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic, 79 (1996), 61-92.
47. T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. In Proc. 15th Symp. on Theoretical Aspects of Computer Science (STACS'98), Springer LNCS 1373, pages 444-454.
48. J. Väänänen. Generalized quantifiers, an Introduction. This volume.
49. L. Wong. Normal forms and conservative properties for query languages over collection types. Journal of Computer and System Sciences 52 (1996), 495-505. Extended abstract in PODS 93.