Logical Definability and Query Languages over Unranked Trees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Leonid Libkin, Frank Neven. Logical Definability and Query Languages over Unranked Trees. In 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings. pages 178-187, IEEE Computer Society, 2003. [doi]

The following publications are possibly variants of this publication:

Logical definability and query languages over ranked and unranked treesMichael Benedikt, Leonid Libkin, Frank Neven. tocl, 8(2):11, 2007. [doi]

Attribute grammars for unranked trees as a query language for structured documentsFrank Neven. jcss, 70(2):221-257, 2005. [doi]

Definable relations and first-order query languages over stringsMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. JACM, 50(5):694-751, 2003. [doi]

runs on WebDSL