Two-variable logic on words with data

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 7-16

  Bojańczyk, Mikołaj ^a   Muscholl, Anca ^b   Schwentick, Thomas ^c   Segoufin, Luc ^d   David, Claire ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c TU DORTMUND UNIVERSITY   (Germany)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY PREDICATE; FINITE ALPHABET; FIRST-ORDER LOGIC; INFINITE DOMAIN;

AUTOMATA THEORY; COMPUTER SCIENCE; DATA ACQUISITION; DATA STRUCTURES; LARGE SCALE SYSTEMS; PETRI NETS;

FORMAL LOGIC;

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

References (19)

1. P. Bouyer, A. Petit and D. Thérien. An algebraic approach to data languages and timed languages. Inf. Comput., 182(2): 137-162 (2003).
2. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-Variable Logic on Data Trees and XML Reasoning. To appear in PODS'06.
3. P. de Groote, B. Guillaume, and S. Salvati. Vector Addition Tree Automata. In LICS'04, pp. 64-73, 2004.
4. S. Demri, R. Lazic, D. Nowak. On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In TIME'05, 2005.
5. J. Esparza and M. Nielsen. Decidability Issues for Petri Nets - a survey. Elektronische Informationsverarbeitung und Kybernetik. 30(3): 143-160 (1994).
6. K. Etessami, M.Y. Vardi, and Th. Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput., 179(2): 279-295 (2002).
7. J. L. Gischer. Shuffle Languages, Petri Nets, and Context-Sensitive Grammars. Commun. ACM, 24(9):597-605 (1981).
8. E. Grädel and M. Otto. On Logics with Two Variables. Theor. Comp. Sci. 224:73-113 (1999).
9. M. Kaminski and N. Francez. Finite memory automata. Theor. Comp. Sci. 134(2):329-363 (1994).
10. E. Kieroński and M. Otto. Small Substructures and Decidability Issues for First-Order Logic with Two Variables. Preprint. 2005.
11. S.R. Kosaraju. Decidability of reachability in vector addition systems. In STOC'84, pp. 267-281. 1984.
12. R.J. Lipton. The reachability problem requires exponential space. Dep. of Comp.Sci., Research report 62, Yale University, 1976.
13. M. Marx. First order paths in ordered trees. In ICDT'05, 2005.
14. E. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. of Comp.. 13:441-459 (1984).
15. M. Mortimer. On languages with two variables. Zeitschr. f math. Logik u. Grundlagen d. Math., 21(1975), pp. 135-140.
16. F. Neven, Th. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log., 15(3): 403-435 (2004).
17. Th. Schwentick, D. Thérien, and H. Vollmer. Partially-Ordered Two-Way Automata: A New Characterization of DA. In Developments in Language Theory (DLT'01), pp. 239-250, 2001.
18. Y. Shemesh, N. Francez. Finite-State Unification Automata and Relational Languages In Inf. Comput., 114(2): 192-213 (1994)
19. D. Thérien and Th. Wilke. Over Words, Two Variables Are as Powerful as One Quantifier Alternation. In STOC'98, pp. 234-240, 1998.