Skip to content

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

Aug 2026 · 0 citations · 17 references
Computer Science

TL;DR

The REAP 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 for AKBC Shared Task 2026.

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.

View source

Similar papers

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
2026

Automatic Chain of Concepts: Conceptual Prompting for LLMs by Constructing Concept Trees

Overall, AutoCoC contributes a reproducible and scalable alternative to expert-authored concept hierarchies by automatically deriving domain-specific prompt structures from documentation, making concept-based prompting more practical for structured knowledge generation.

Hurile Borjigin, Nishtha N. Vaidya, Thomas A. Runkler et al. · 0 citations
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
Preprint Aug 2026

Direct Construction of Disambiguated Knowledge Bases from Large Language Models

This work proposes GPTKB 2.0, a methodology for constructing disambiguated KBs directly from large language models (LLMs) that incorporates on-the-fly disambiguation of entities, relations and classes, and is meticulously designed to satisfy both scalability and disambiguation accuracy.

Yujia Hu, Tuan-Phong Nguyen, S. Razniewski · 0 citations
Preprint Aug 2026

Towards Researcher Agents for Knowledge-Graph Question Answering

This work presents an agentic text-to-SPARQL system that goes one step beyond static tool-using agents: a researcher agent that, after each round of inference on a validation set, proposes and tests changes to its own prompts, rules, and tool-orchestration code.

Tommaso Soru, Abdulsobur Oyewale · 0 citations
Conference Open access Aug 2026

From Tacit Knowledge to Structured Documents: A Framework for Knowledge Elicitation

The Assistant-Scribe-Knowledge Checker (ASK) framework for generating structured specification documents through guided interviews is evaluated in a consulting-firm setting where consultants are required to produce project “return-of-experience” documents to capture reusable knowledge.

Sylvain Roudiere, Bianca Lento · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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