Ontology construction requires deciding which objects, attributes, and structural relations should be accepted as valid knowledge. Language models can propose such structures from text, but their outputs can still be unsupported or inconsistent.
arXiv:2608. 06331v1 Announce Type: cross Abstract: From natural-language query interfaces to automated report generation, data analysis tools need a description of the data: the real-world entities it contains, which columns function as measures or identifiers, and how tables connect into units of analysis.
By Donna Hooshmand, Shubham Shahi, Cameron Barrie, Abhratanu Dutta, Marko Sterbentz, Harper Pack, Kristian J. Hammond
The paper introduces a pipeline that automatically creates ontology‑grounded multiple‑choice question benchmarks for evaluating large language models (LLMs) on logical reasoning tasks in scientific AI. By using OWL 2 ontologies, correct answers are guaranteed by design and distractors are generated and formally verified as incorrect through an OWL reasoner. Experiments on three ontologies—Pizza, PMDco, and DOID—yielded 112, 2,491, and 15,216 MCQs, respectively, with high natural‑language quality and challenging zero‑shot performance for six LLMs.
By Nishtha N. Vaidya, Stephan Grimm, Thomas Hubauer, Thomas A. Runkler
arXiv:2608.29311v1 Announce Type: new
Abstract: Classic Formal Concept Analysis (FCA) primarily focuses on the positive relationships between objects and attributes and does not have mechanisms for h...
By Zhenghua Pan
arXiv:2606. 08477v1 Announce Type: new Abstract: Knowledge extraction from symbolic data often produces abstractions that are formally defined but not immediately interpretable by users.
By Alain Gutierrez, Marianne Huchard, Pierre Martin, Andr\'e Miralles, Violaine Prince
arXiv:2609.24372v1 Announce Type: new
Abstract: In-context learning (ICL) based on large language models (LLMs) has shown promising potential in alleviating performance bottlenecks caused by the limi...
By Jingyu Wang, Shijie Wu, Fusheng Jin
arXiv:2606. 26101v1 Announce Type: cross Abstract: Reliable evaluation of large language models should separate supported answering from unsupported guessing without conflating either with data contamination, prompt idiosyncrasy, or generic refusal behavior.
By Renwei Meng, Bowen Zhang, Jian Wang, Xican Wang, Haoyi Wu, Xuanyan Qiu, Shengan Yang
arXiv:2607. 18029v1 Announce Type: cross Abstract: Researchers need to answer ad-hoc questions about the contents of domain-specific archives but often lack the expertise to write structured queries on the metadata.
By Blake G. Fitch, Cato Elia Kurtz
arXiv:2607. 14494v1 Announce Type: new Abstract: Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.
By Yiming Zhang, Koji Tsuda
The paper introduces Intelligent Target Locator (ITL), a method that measures how well a document aligns with concepts in a Structured Reference Document (SRD) by creating concept‑specific term profiles and computing a textual‑unit–concept affinity matrix. ITL assigns importance weights to terms based on concept membership, term specificity, and discriminability, enabling traceable, quantitative alignment scores at multiple granularity levels. An internal consistency test on the 17 Sustainable Development Goals showed that each goal statement achieved its highest affinity with its corresponding concept, demonstrating ITL’s ability to distinguish conceptual profiles.
By Ra\'ul Gir\'aldez, Dayrelis Mena, Jes\'us S. Aguilar--Ruiz
The paper introduces Constrained Entity Selection under Partial Knowledge (CES-PK), a framework for improving large language model (LLM) based knowledge graph question answering (KGQA) by filtering candidate answers with lightweight symbolic constraints instead of full semantic parsing. CES-PK uses a three-valued constraint semantics—satisfied, violated, unknown—to handle incomplete knowledge graphs and avoid incorrect rejections under open‑world assumptions. Experiments on the Hetionet biomedical knowledge graph show that applying type, relation, and exclusion constraints increases precision while preserving recall, and that satisfied constraints can be used to rank remaining candidates.
By Emanuel Kitzelmann
arXiv:2606. 08571v1 Announce Type: cross Abstract: Large language models frequently fail in a characteristic way: rather than acknowledging ignorance, they produce fluent but incorrect answers to questions that lie beyond their knowledge boundaries.
By Subramanyam Sahoo