Future-looking logics on data words and trees

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

Volumn 5734 LNCS, Issue , 2009, Pages 331-343

  Figueira, Diego ^a   Segoufin, Luc ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TREE; DATA VALUES; FINITE ALPHABET; INFINITE DOMAINS; LOWER BOUNDS; SATISFIABILITY;

COMPUTER SCIENCE;

CONTROL THEORY;

EID: 70349332756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_29     Document Type: Conference Paper

References (15)

1. Benedikt, M., Fan, W., Geerts, F.: XPath satis.ability in the presence of DTDs. J. ACM 55(2) (2008)
2. Björklund, H., Martens, W., Schwentick, T.: Optimizing conjunctive queries over trees using schema information. In: Ochmánski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.5162, pp. 132-143. Springer, Heidelberg (2008)
3. Bojánczyk, M., David, C., Muscholl, A., Schwentick, T., Segou.n, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10-19 (2006) (Pubitemid 46946462)
4. Bojánczyk, M., Muscholl, A., Schwentick, T., Segou.n, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7-16 (2006)
5. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137-162 (2003)
6. Clark, J., DeRose, S.: XML path language (XPath) (1999), W3C Recommendation, http://www.w3.org/TR/xpath
7. David, C.: Complexity of data tree patterns over XML documents. In: Ochmánski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.5162, pp. 278-289. Springer, Heidelberg (2008)
8. Demri, S., Lazíc, R.: LTL with the freeze quanti.er and register automata. ACM Transactions on Computational Logic (2009)
9. Demri, S., Lazíc, R., Nowak, D.: On the freeze quanti.er in constraint LTL: Decidability and complexity. In: TIME, pp. 113-121 (2005)
10. Figueira, D.: Satis.ability of downward XPath with data equality tests. In: PODS, Providence, Rhode Island, USA. ACM Press, New York (2009)
11. Geerts, F., Fan, W.: Satis.ability of XPath queries with sibling axes. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.3774, pp. 122-137. Springer, Heidelberg (2005)
12. Jurdzínski, M., Lazíc, R.: Alternating automata on data trees and XPath satis.ability. CoRR, abs/0805.0330 (2008)
13. Minsky, M.L.: Computation: .nite and in.nite machines. Prentice-Hall, Inc., Englewood Cli.s (1967)
14. Ouaknine, J.,Worrell, J.: On Metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol.3921, pp. 217-230. Springer, Heidelberg (2006)
15. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5), 251-261 (2002)