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]
@inproceedings{LibkinN03,
title = {Logical Definability and Query Languages over Unranked Trees},
author = {Leonid Libkin and Frank Neven},
year = {2003},
url = {http://csdl.computer.org/comp/proceedings/lics/2003/1884/00/18840178abs.htm},
tags = {query language},
researchr = {https://researchr.org/publication/LibkinN03},
cites = {0},
citedby = {0},
pages = {178-187},
booktitle = {18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-1884-2},
}