PDL for ordered trees

Journal of Applied Non-Classical Logics

Volumn 15, Issue 2, 2005, Pages 115-135

  Afanasiev, Loredana ^a   Blackburn, Patrick ^b   Dimitriou, Ioanna ^a   Gaiffe, Bertrand ^b   Goris, Evan ^a   Marx, Maarten ^a   De Rijke, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b INRIA   (France)

Author keywords

Complexity; Definability; Expresivity; Ordered trees; Pdl

Indexed keywords

EID: 26944471502     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.15.115-135     Document Type: Article

References (29)

1. ABI 00] ABITEBOUL S., BUNEMAN P., SUCIU D., Data on the web, Morgan Kaufman, 2000.
2. ALECHINA N., IMMERMAN N., "Reachability Logic: An Efficient Fragment of Transitive Closure Logic", Logic Journal of the IGPL, vol. 8, num. 3, 2000, p. 325-337.
3. ALECHINA N., DEMRI S., DE RIJKE M., "A Modal Perspective on Path Constraints", Journal of Logic and Computation, vol. 13, 2003, p. 1-18.
4. BLACKBURN P., MEYER-VIOL W., "Linguistics, Logic, and Finite Trees", Logic Journal of the IGPL, vol. 2, 1994, p. 3-29.
5. BLACKBURN P., MEYER-VIOL W., DE RIJKE M., "A proof system for finite trees", BÜNING H. K., Ed., Computer Science Logic, vol. 1092 of LNCS, Springer, 1996, p. 86-105. (Pubitemid 126089924)
6. BLACKBURN P., DE RIJKE M., VENEMA Y., Modal Logic, Cambridge University Press, 2001.
7. BLACKBURN P., GAIFFE B., MARX M., "Variable free reasoning on finite trees", Proceedings of Mathematics of Language (MOL-8), Bloomington, 2003.
8. CONSORTIUM W.-W. W., "Extensible Markup Language (XML) 1.0 (Second Edition) W3C", http://www.w3.org/TR/REC-xml, 2004.
9. ETESSAMI K., VARDI M., WILKE TH., "First-order logic with two variables and unary temporal logic", Proc. LICS'97, 1997, p. 228-235.
10. FISHER M., LADNER R., "Propositional dynamic logic of regular programs", J. Comput. Syst. Sci., vol. 18, num. 2, 1979, p. 194-211. (Pubitemid 9461410)
11. GABBAY D., GUENTHER F., Eds., Handbook of Philosophical Logic, vol. 2, Reidel, Dordrecht, 1984.
12. GOTTLOB G., KOCH C., "Monadic Datalog and the Expressive Power of Languages for Web Information Extraction", PODS'02, 2002, p. 17-28. (Pubitemid 35009478)
13. HAREL D., KOZEN D., TIURYN J., Dynamic Logic, MIT Press, 2000.
14. KAMP J., "Tense Logic and the Theory of Linear Order", PhD thesis, University of California, Los Angeles, 1968.
15. KRACHT M., "Syntactic codes and grammar refinement", Journal of Logic, Language and Information, vol. 4, 1995, p. 41-60.
16. KRACHT M., "Inessential Features", RETORE C., Ed., Logical Aspects of Computational Linguistics, num. 1328 LNAI, p. 43-62, Springer, 1997. (Pubitemid 127153998)
17. KRACHT M., Tools and Techniques in Modal Logic, Num. 142 Studies in Logic, Elsevier, Amsterdam, 1999.
18. MARX M., "Conditional XPath, the first order complete XPath dialect", Proceedings of PODS'04, 2004, p. 13-22.
19. MARX M., DE RIJKE M., "Semantic Characterizations of XPath", TDM'04 workshop on XML Databases and Information Retrieval., Twente, The Netherlands, June 21, 2004.
20. MARX M., "First order paths in ordered trees", EITER T., LIBKIN L., Eds., Proc. ICDT 2005, vol. 3363 of LNCS, 2005, p. 114-128.
21. NEVEN F., SCHWENTICK T., "Expressive and Efficient Pattern Languages for Tree-Structured Data", Proc. PODS, ACM, 2000, p. 145-156.
22. NEVEN F., SCHWENTICK T., "On the Power of Tree-Walking Automata", U. MONTANARI J. ROLIM E. W., Ed., Automata, Languages and Programming, Proceedings, ICALP 2000, LNCS 1853, Springer, 2000, p. 547-560.
23. PALM A., "Transforming tree constraints into formal grammars", PhD thesis, Universität Passau, 1997.
24. PALM A., "Propositional tense logic for trees", Sixth Meeting on Mathematics of Language, University of Central Florida, Orlando, Florida, 1999.
25. PRATT V., "Models of Program Logics", Proceedings of the 20th IEEE symposium on Foundations of Computer Science, 1979, p. 115-122.
26. ROGERS J., A Descriptive Approach to Language Theoretic Complexity, CSLI Press, 1998.
27. SPAAN E., "Complexity of modal logics", PhD thesis, University of Amsterdam, Institute for Logic, Language and Computation, 1993.
28. VARDI M., WOLPER P., "Automata-theoretic techniques for modal logics of programs", Journal of Computer and System Sciences, vol. 32, 1986, p. 183-221. (Pubitemid 16586688)
29. WEYER M., "Decidability of S1S and S2S", ET AL. E. G., Ed., Automata, Logics, and Infinite Games, vol. 2500 of LNCS, p. 207-230, Springer, 2002. (Pubitemid 36140826)