Skip to content

Formal Reasoning with Learned Predicates (Extended Abstract)

2026 · Digital library · 0 citations · 9 references
Computer Science

TL;DR

This paper provides its computational complexity analysis for ontologies specified in (the Description Logic counterpart of) RDFS, and binary Multi-Layer Perceptrons, and binary Multi-Layer Perceptrons.

View source

Similar papers

Preprint Aug 2026

Toward Effective and Reliable LLM Agents via Dynamic Ontology

OaK is presented, an ontology-as-a-kernel framework that dynamically constructs and refines task-oriented ontologies for LLM agents and shows that OaK improves standard LLM agents, strengthens evidence grounding, and boosts the reliability of multi-step reasoning.

Xiaohui Zhang, Ze-Qun Sun, Cheng Yang et al. · 0 citations

INDUCING KNOWLEDGE

Unknown authors · 2 citations

Towards an Evaluation Framework for Generated Formal Knowledge

This work proposes a set of metrics designed to evaluate the ability of LRMs to generate formal knowledge in order to solve domain-specific problems, and curates – based on a collection of LRM-generated Prolog programs – common issues in generated KBs, and derive metrics that can be used to assess such issues.

Maxime Haurel, Armelle Brun, Mathieu d'Aquin · 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

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