Which bird does not have wings: Negative-constrained KGQA with Schema-guided Semantic Matching and Self-directed Refinement
Midan Shim, Seokju Hwang, Kaehyun Um, Kyong-Ho Lee

TL;DR
This paper introduces NEST KGQA, a new task and dataset focusing on negative constraints in knowledge graph question answering, and proposes CUCKOO, a framework that improves semantic matching and refinement for complex, constrained questions.
Contribution
The paper presents NEST KGQA and PyLF for better handling negative constraints, and introduces CUCKOO, a novel framework for multiple constraints with self-directed refinement.
Findings
CUCKOO outperforms baselines on KGQA and NEST-KGQA benchmarks.
It effectively handles questions with multiple constraints.
The framework improves robustness and reduces computational cost.
Abstract
Large language models still struggle with faithfulness and hallucinations despite their remarkable reasoning abilities. In Knowledge Graph Question Answering (KGQA), semantic parsing-based approaches address the limitations by understanding constraints in a user's question and converting them into a logical form to execute on a knowledge graph. However, existing KGQA benchmarks and methods are biased toward positive and calculation constraints. Negative constraints are neglected, although they frequently appear in real-world questions. In this paper, we introduce a new task, NEgative-conSTrained (NEST) KGQA, where each question contains at least one negative constraint, and a corresponding dataset, NestKGQA. We also design PyLF, a Python-formatted logical form, since existing logical forms are hardly suitable to express negation clearly while maintaining readability. Furthermore, NEST…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
