Last update: Sun Mar 31 02:49:53 MDT 2019
@Article{Kosa:2012:CSP,
author = "Bal{\'a}zs K{\'o}sa",
title = "Containment and Satisfiability Problem for {XPath}
with Recursion",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7503",
pages = "240--253",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33074-2_18",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:57 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33074-2_18/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33074-2",
book-URL = "http://www.springerlink.com/content/978-3-642-33074-2",
fjournal = "Lecture Notes in Computer Science",
}