Towards a characterization of order-invariant queries over tame structures

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 276-291

  Benedikt, Michael ^a   Segoufin, Luc ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; QUERY LANGUAGES; TREES (MATHEMATICS);

FINITE STRUCTURES; INVARIANT QUERIES; LINEAR ORDER; TREEWIDTH;

FORMAL LOGIC;

EID: 26944432291     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_20     Document Type: Conference Paper

References (23)

1. [AHV95] S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. [BP89] D. Beauquier and J.-E. Pin. Factors of words. In ICALP, 1989.
3. [BS05] M. Benedikt and L. Segoufin. Regular Tree Languages Definable in FO. Available from the authors. An abstract has appeared in STACS, 2005.
4. [BMW01] A. Brüggemann-Klein, M. Murata, and D. Wood. Regular Tree and Regular Hedge Languages over Unranked Alphabets Available at ftp://ftp11.informatik.tu-muenchen.de/pub/misc/caterpillars/, 2001.
5. [Büc60] J. Büchi. Weak second-order logic and finite automata. S. Math. Logik Grunlagen Math., 6:66-92, 1960.
6. [CK90] C.C. Chang and H.J. Keisler. Model Theory. North-Holland Elsevier, 1990.
7. [Cou90] B. Courcelle. The Monadic Second Order Logic of Graphs I: Recognizable Sets of Finite Graphs Information and Computation, 1990.
8. [Cou91] B. Courcelle. The Monadic Second Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability Theor. Comput. Sci, 1991.
9. [Cou96] B. Courcelle. The Monadic Second Order Logic of Graphs X: Linear Orders Theoretical Computer Science 160:87-143, 1996.
10. [Don70] J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406-451, 1970.
11. [EF95] H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
12. [Nie05] H. Niemisto. On Locality and Uniform Reduction. To appear in LICS, 2005.
13. [FmtOpen] http://www-mgi.informatik.rwth-aachen.de/FMT Open Problems in Finite Model Theory
14. [GS00] M. Grohe and T. Schwentick. Locality of Order-Invariant First-Order Queries. ACM TOCL, 2000.
15. [Lap98] D. Lapoire. Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width. In STACS, 1998.
16. [Lib04] L. Libkin. Elements of finite model theory, springer, 2004.
17. [Otto00] M. Otto. Epsilon-logic is more expressive then first-order logic on finite structures. Journal of Symbolic Logic, 65(4), pp. 1749-757, 2000.
18. [RS84] N. Robertson and P. Seymour. Graph Minors III: planar tree-width. J. Combin. Theory Ser. B, 36:49-64,1984.
19. [Ross03] B. Rossman. Successor-invariance in the finite. In LICS, 2003.
20. [Str94] H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, 1994.
21. [TATA] H. Comon et al. Tree Automata: Techniques and Applications. Available at www.grappa.univ-lille3.fr/tata.
22. [Tho97] W. Thomas. Handbook of formal languages, volume 3, chapter 7. Springer, 1997.
23. [TW68] J.W. Thatcher and J.B. Wright. Generalized finite automata woth an application to a decision problem of second order logic. Math. Syst. Theory, 2:57-82, 1968.