Transitive closure logic, nested tree walking automata, and XPath
暂无分享,去创建一个
[1] Dan Suciu,et al. Journal of the ACM , 2006 .
[2] Thomas Schwentick,et al. Expressive Power of Pebble Automata , 2006, ICALP.
[3] Maarten Marx,et al. Axiomatizing the Logical Core of XPath 2.0 , 2008, Theory of Computing Systems.
[4] Maarten Marx,et al. XPath with Conditional Axis Relations , 2004, EDBT.
[5] Thomas Colcombet,et al. Tree-Walking Automata Do Not Recognize All Regular Languages , 2008, SIAM J. Comput..
[6] Balder ten Cate,et al. Axiomatizing the Logical Core of XPath 2.0 , 2007, Theory of Computing Systems.
[7] Neil Immerman,et al. First-Order and Temporal Logics for Nested Words , 2007, LICS 2007.
[8] Carsten Lutz,et al. The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.
[9] Susan B. Davidson,et al. Extending XPath to Support Linguistic Queries , 2005 .
[10] Philippe Schnoebelen,et al. Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[11] Joost Engelfriet,et al. Nested Pebbles and Transitive Closure , 2006, STACS.
[12] Wenfei Fan,et al. Rewriting Regular XPath Queries on XML Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[13] Joost Engelfriet,et al. XML transformation by tree-walking transducers with invisible pebbles , 2007, PODS.
[14] Balder ten Cate,et al. XPath, transitive closure logic, and nested tree walking automata , 2008, PODS.
[15] David E. Muller,et al. Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..
[16] Michael Benedikt,et al. XML Subtree Queries: Specification and Composition , 2005, DBPL.
[17] Maarten Marx,et al. Conditional XPath , 2005, TODS.
[18] Balder ten Cate,et al. The expressivity of XPath with transitive closure , 2006, PODS.
[19] Neil Immerman,et al. First-Order and Temporal Logics for Nested Words , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[20] Thomas Colcombet,et al. Tree-walking automata do not recognize all regular languages , 2005, STOC '05.
[21] M. Rabin. Weakly Definable Relations and Special Automata , 1970 .
[22] Perlindström. First Order Predicate Logic with Generalized Quantifiers , 1966 .
[23] M. de Rijke,et al. Semantic characterizations of navigational XPath , 2005, SGMD.
[24] Balder ten Cate,et al. Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees , 2009, LFCS.
[25] Thomas Schwentick. On Diving in Trees , 2000, MFCS.
[26] Thomas Schwentick,et al. On the power of tree-walking automata , 2000, Inf. Comput..
[27] Erich Grädel,et al. On Transitive Closure Logic , 1991, CSL.
[28] Andreas Potthoff,et al. Logische Klassifizierung regulärer Baumsprachen , 1994 .
[29] Licia Capra,et al. xlinkit: a consistency checking and smart link generation service , 2002, TOIT.
[30] Gabriel M. Kuper,et al. Structural properties of XPath fragments , 2003, Theor. Comput. Sci..
[31] Michael Benedikt,et al. XPath satisfiability in the presence of DTDs , 2008, JACM.