REAP: Relation-Aware Elicitation and Parsing for Closed-Book Knowledge Base Construction from LLMs

Thanh-Dan Bui, Thanh-Trung Do, Tuan-Phong Nguyen


Abstract
We present the REAP system for the AKBC Shared Task 2026 on constructing knowledge bases from language models in a closed-book setting, subject to a budget of at most 32B parameters and no model fine-tuning. Our system combines structured chain-of-thought reasoning, relation-specific query strategies, and a reasoning-based empty-set gate to elicit parametric knowledge, followed by direct extraction into valid JSON arrays. On the test set, the system, built on the Mistral-Small-24B-Instruct-2501 model, achieves a macro-F1 score of 0.62, with particularly strong results on countryLandBordersCountry (F1 = 0.95), companyTradesAtStockExchange (F1 = 0.73), and hasArea (F1 = 0.77). Our code is publicly available at https://github.com/yammdd/AKBC-Shared-Task-2026.
Anthology ID:
2026.akbc-1.31
Volume:
Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Jan-Christoph Kalo, Ndapa Nakashole, Simon Razniewski, Fabian M. Suchanek, Andreas Vlachos, Andrew McCallum
Venues:
AKBC | WS
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
434–440
Language:
URL:
https://aclanthology.org/2026.akbc-1.31/
DOI:
Bibkey:
Cite (ACL):
Thanh-Dan Bui, Thanh-Trung Do, and Tuan-Phong Nguyen. 2026. REAP: Relation-Aware Elicitation and Parsing for Closed-Book Knowledge Base Construction from LLMs. In Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026), pages 434–440, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
REAP: Relation-Aware Elicitation and Parsing for Closed-Book Knowledge Base Construction from LLMs (Bui et al., AKBC 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.akbc-1.31.pdf