Skip to content

Hierarchy Guided Extraction with Answer Set Programming and Large Language Models

Unknown authors
· 0 citations · 18 references

TL;DR

HGX is introduced, which natively embeds domain dependencies into an expressive parent-child hierarchy, and achieves up to a 92% reduction in ASP solver invocations compared to flat evaluation strategies, while strictly preserving extraction accuracy.

View source

Similar papers

Preprint Aug 2026

Guided Table Retrieval for Structured Data Search

guided table retrieval is presented, a four-phase pipeline that combines deterministic grounding via hash-based predictors, structural exploration of join-graph reachability, LLM-powered disambiguation of sources and targets, and algorithmic merging into minimal, topologically ordered join trees.

Alekh Jindal, J. Pandey, C. Pavlopoulou et al. · 0 citations
Open access Aug 2026

Constrained Entity Selection Under Partial Knowledge for LLM-Based Knowledge Graph QA

Experiments show that precision improves by filtering invalid candidates, while recall is preserved due to retaining candidates whose constraints are not explicitly violated, and a three-valued constraint semantics that avoids incorrect rejections under open-world assumptions.

Emanuel Kitzelmann · 0 citations

ExpeSQL: An Efficient, Experience-Guided Decompositional Search Framework for Text-to-SQL

This work introduces ExpeSQL, a zero-shot, open-source–compatible, and efficient framework that combines divide-and-conquer reasoning, Best-of-N candidate selection, and self-critique with experience-guided refinement that establishes a new paradigm for deployable, self-improving Text-to-SQL systems in dynamic, real-wo...

Unknown authors · 0 citations
Aug 2026

SLOPE: Fine-Grained Log Parser Combining Syntax with LLM-Distilled Semantic

This work proposes SLOPE, a fine-grained log parser combining syntax with semantics, which achieves an average parsing accuracy improvement of 61.2% and 5.9 times higher throughput over all baselines, exhibiting state-of-the-art robustness.

Shu-Ting Lai, Haiyu Huang, Peng-Fei Chen et al. · 0 citations
Open access 2026

StruQTO: Structure-aware Query Tree Optimization for Complex Logical Query over Knowledge Graphs

— Existing methods for complex logical query answering over knowledge graphs fall into two categories. The first category relies on explicitly engineered logical operators, which suffer from pronounced error accumulation when handling complex query structures. The second category directly delegates reasoning to Large L...

Yu-Ying Chen, Guan-Feng Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.