On the hardness of learning queries from tree structured data

DOI10.1007/S10878-013-9609-9zbMath1321.90144OpenAlexW1971310743WikidataQ114689778 ScholiaQ114689778MaRDI QIDQ2343989

Jian-Zhong Li, Xianmin Liu

Publication date: 11 May 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9609-9

zbMATH Keywords

hardnessinapproximabilitytree query learning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• XQuery
• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Characteristic sets for polynomial grammatical inference
• Tree pattern query minimization
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
• Inductive inference of formal languages from positive data
• Language identification in the limit

This page was built for publication: On the hardness of learning queries from tree structured data