Skip to content

Grounded and Faithful P&ID Reasoning: Constraining Vision-Language Models with Recovered Evidence Graphs

Sep 2026 · 0 citations · 18 references
Computer Science

TL;DR

Graph-Grounded Harness (The authors') recovers an explicit graph of the drawing---its symbols, the process connections between them, and the tags that name them---and then requires the model to answer only by querying that graph through seven read-only operators, so a topology claim is returned only when it cites the query results that support it.

Abstract

Piping and Instrumentation Diagrams (P&IDs) are the authoritative maps of process plants: isolation, maintenance, and HAZOP decisions depend on what connects to what. Vision-language models describe these sheets fluently, yet they often invent or miss process connections---and an invented or missed link can reverse an isolation or reachability call, so a plant decision cannot trust a fluent answer that was never checked against the linework. We instead recover an explicit graph of the drawing---its symbols, the process connections between them, and the tags that name them---and then require the model to answer only by querying that graph through seven read-only operators, so a topology claim is returned only when it cites the query results that support it. On TopoPID-VQA, a new suite of 3000 topology questions over these sheets, Graph-Grounded Harness (Ours) raises exact match accuracy from 36.7--41.3% under image-only prompting to 74.3--76.0% for Qwen3-VL-4B, Qwen3-VL-8B, and Gemma-4-E4B. It does so on an imperfect substrate: on Digitize-PID dataset the recovered graph scores F1 0.742 on exact process connections, and 0.801 once symbols and tags are pooled in. The residual errors track that gap---grounding pays off where the recovered graph is right, and perception error still breaks topology questions where it is not.

View source

Similar papers

#machine learning Preprint Aug 2026

ClosureBench: A Constructive Benchmark for Compositional Graph Reasoning

ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...

S. Goria · 0 citations
Preprint Aug 2026

Evidence-Carrying Validation for Knowledge Graphs

This work presents an evidence-carrying validation interface: every selected node-shape check returns either a satisfaction trace or failure witness, and shows how programs combine passing and failing evidence to diagnose missing information and guide repair.

Gabe Fierro · 0 citations
Preprint Aug 2026

Why Do LLMs Fail at OCL Generation? A Graph Reasoning Perspective

The underlying causes of LLM failures in OCL generation are investigated, framing the task as a graph reasoning problem over UML class diagrams and finding that OCL generation performance significantly degrades with increasing navigation depth and structural complexity.

Hamza Attarwala, Moataz Chouchen, Mohammad Hamdaqa et al. · 0 citations
Open access Aug 2026

Exploiting Verification Asymmetry for Failure-Aware Graph Reasoning in Knowledge Graph Question Answering with LLMs

This work introduces GRACE (Graph Reasoning with Adaptive Controller and Evidence), which feeds rejection back into retrieval and restores accept–reject symmetry in the search, and improves KG-grounded reasoning on WebQSP and ComplexWebQuestions.

Yimo Zhao, Tianyuan Hu, Shuai Jiang · 0 citations
Preprint Aug 2026

SodaMem: Evidence-Grounded Temporal Graph Memory for LLM Agents

SodaMem is presented, an evidence-grounded temporal graph memory that extracts typed FactEvents with mandatory provenance spans, persists mention time, occurrence time, and validity with SUPERSEDES/CONTRADICTS/UPDATES edges under hybrid lexical-dense indexing and answers via a planner-reader loop that gathers citable e...

Fengrong Wan, Chengcan Wu, Ning Lyu · 1 citation
#artificial intelligence Preprint Sep 2026

The Path Matters: Evaluating Small Language Models Beyond Answer Accuracy in KGQA

This work isolates SLM graph reasoning from navigation and traceability capability by employing the THESEUS navigation and traceability framework and using frozen, off-the-shelf SLMs as local action policies, and results motivate evaluating SLM graph reasoning beyond endpoint accuracy alone.

Eduin E. Hernandez, Sergio A. Diaz, Luis F. Garcia et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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