DeSQ decomposes questions into atomic constraints, maps them to SPARQL fragments with placeholders, grounds the placeholders, and assembles complete queries, outperforming prior methods on four of five benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
DeSQ: Decomposition-based SPARQL Query Generation
DeSQ decomposes questions into atomic constraints, maps them to SPARQL fragments with placeholders, grounds the placeholders, and assembles complete queries, outperforming prior methods on four of five benchmarks.