Two-variable logic on data words

ACM Transactions on Computational Logic

Volumn 12, Issue 4, 2011, Pages

  Bojanćzyk, Mikolaj ^a   David, Claire ^b   Muscholl, Anca ^c   Schwentick, Thomas ^d   Segoufin, Luc ^e  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ PARIS EST   (France)

^c UNIVERSITÉ BORDEAUX 1   (France)

^d TU DORTMUND UNIVERSITY   (Germany)

^e CNRS   (France)

Author keywords

Data words; First order logic; One equivalence relation; Petri net reachability; Two variables

Indexed keywords

DATA VALUES; DATA WORDS; EQUIVALENCE RELATIONS; FINITE ALPHABET; FIRST-ORDER LOGIC; INFINITE DOMAINS; REACHABILITY; SATISFIABILITY; SATISFIABILITY PROBLEMS; SEMI STRUCTURED DATA; TIMED AUTOMATA; TWO VARIABLES;

PETRI NETS; TEMPORAL LOGIC;

COMPUTABILITY AND DECIDABILITY;

EID: 80051933837     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1970398.1970403     Document Type: Article

References (29)

1. BJÖRKLUND, H. AND BOJAŃCZYK, M. 2007a. Bounded depth data trees. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07). Lecture Notes in Computer Science, vol. 4596, Springer-Verlag, Berlin, Germany, 862-874.
2. BJÖRKLUND, H. AND BOJAŃCZYK, M. 2007b. Shuffle expressions and words with nested data. In Proceedings of the 32nd Mathematical Foundations of Computer Science International Symposium (MFCS'07). Lecture Notes in Computer Science, vol. 4708, Springer-Verlag, Berlin, Germany, 750-761.
3. BJÖRKLUND, H. AND SCHWENTICK, T. 2007. On notions of regularity for data languages. In Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07). Lecture Notes in Computer Science, vol. 4639, Springer-Verlag, Berlin, Germany, 88-99.
4. BOJAŃCZYK, M., DAVID, C., MUSCHOLL, A., SCHWENTICK, T., AND SEGOUFIN, L. 2006a. Two-variable logic on data trees and XML reasoning. In Proceedings of the 25th SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'06). ACM Press, New York, NY, 10-19. (Pubitemid 46946462)
5. BOJAŃCZYK, M.,MUSCHOLL, A., SCHWENTICK, T., AND SEGOUFIN, L. 2009. Two-variable logic on data tree and XML reasoning. J. ACM 56, 3, 1-48.
6. BOJAŃCZYK, M.,MUSCHOLL, A., SCHWENTICK, T., SEGOUFIN, L., AND DAVID, C. 2006b. Two-variable logic on words with data. In Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06). IEEE Computer Society Press, Los Alamitos, CA, 7-16. (Pubitemid 47130347)
7. BOUYER, P., PETIT, A., AND THÉRIEN, D. 2003. An algebraic approach to data languages and timed languages. Inform. Computat. 182, 2, 137-162.
8. DEMRI, S. AND LAZIĆ, R. 2009. LTL with the freeze quantifier and register automata. ACM Trans. Computat. Logic 10, 3, 1-30.
9. DEMRI, S., LAZIĆ, R., AND NOWAK, D. 2007. On the freeze quantifier in constraint LTL: Decidability and complexity. Inform. Computat. 205, 1, 2-24. (Pubitemid 44854451)
10. DICKSON, L. E. 1913. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413-422.
11. ESPARZA, J. AND NIELSEN, M. 1994. Decidability issues for Petri nets-a survey. Elektron. Inform. Kybernet. 30, 3, 143-160.
12. ETESSAMI, K., VARDI, M. Y., AND WILKE, T. 2002. First-order logic with two variables and unary temporal logic. Inform. Computat. 179, 2, 279-295.
13. FÜRER, M. 1984. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logic and Machines: Decision Problems and Complexity. Lecture Notes in Computer Science, vol. 171, Springer-Verlag, Berlin, Germany, 312-319.
14. GISCHER, J. L. 1981. Shuffle Languages, Petri nets, and context-sensitive grammars. Comm. ACM 24, 9, 597-605.
15. GRÄDEL, E. AND OTTO, M. 1999. On logics with two variables. Theoret. Comput. Sci. 224, 1-2, 73-113. (Pubitemid 129608369)
16. GROOTE, P. D., GUILLAUME, B., AND SALVATI, S. 2004. Vector addition tree automata. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04). IEEE Computer Society Press, Los Alamitos, CA, 64-73.
17. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA.
18. KAMINSKI, M. AND FRANCEZ, N. 1994. Finite-memory automata. Theoret. Comp. Sci. 134, 2, 329-363.
19. KIEROŃSKI, E. AND OTTO, M. 2005. Small substructures and decidability issues for first-order logic with two variables. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05). IEEE Computer Society Press, los Alamitos, CA, 448-457. (Pubitemid 41462591)
20. KOSARAJU, S. R. 1982. Decidability of reachability in vector addition systems. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC'82). ACM Press, New York, NY, 267-281.
21. LIPTON, R. 1976. The reachability problem requires exponential space. Tech. rep. 62, Yale University, New Haven, CT.
22. MAYR, E.W. 1984. An algorithm for the general Petri net reachability problem. SIAM J. Comp. 13, 3, 441-460.
23. MORTIMER, M. 1975. On languages with two variables. Zeit. Math. Logik Grund. Math. 21, 135-140.
24. NEVEN, F., SCHWENTICK, T., AND VIANU, V. 2004. Finite state machines for strings over infinite alphabets. ACM Trans. Computat. Logic 15, 3, 403-435.
25. OTTO, M. 2001. Two variable first-order logic over ordered domains. J. Symbol. Logic 66, 2, 685-702.
26. SCHWENTICK, T., THÉRIEN, D., AND VOLLMER, H. 2001. Partially-ordered two-way automata: A new characterization of DA. In Proceedings of the 5th International Conference on Developments in Language Theory (DLT'01). Lecture Notes in Computer Science, vol. 2295, Springer-Verlag, Berlin, Germany, 239-250.
27. SHEMESH, Y. AND FRANCEZ, N. 1994. Finite-state unification automata and relational languages. Inform. Computat. 114, 2, 192-213.
28. THÉRIEN, D. AND WILKE, T. 1998. Over words, two variables are as powerful as one quantifier alternation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC'98). ACM Press, New York, NY, 234-240.
29. WEIS, P. AND IMMERMAN, N. 2009. Structure theorem and strict alternation hierarchy for FO2 on words. Logic. Meth. Comp. Sci. 5, 3.