arXiv Computation and Language By Boyu Cao, Wenshuo Wang

A Bounded Evaluation Protocol for Representational Systematicity

Read the original on arXiv Computation and Language →

The paper introduces Bounded-RS, a protocol for testing whether neural networks are representationally systematic. It evaluates explanations by checking if the claimed representation is recoverable and causally used, then classifies the explanation into one of four states: Unsupported, Present-only, Causal-use, or Undetermined. Applied to a semantic‑parsing benchmark, the protocol finds that T5’s role‑filler Binding explanation is Causal‑use while its Geometry explanation is Unsupported, and it demonstrates high reliability across different configurations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Oct 26

Do Language Models Trust Their Own Justifications? A Study on Functional Consistency

The paper investigates whether the tokens highlighted by large language models (LLMs) as key to their predictions are behaviorally consistent when those tokens are manipulated. Using sufficiency, comprehensiveness, and counterfactuality metrics, the authors evaluate closed‑source GPT‑4o‑mini and open‑source models Gemma3, Granite8B, and DeepSeek on IMDB and Steam review datasets. Results show that GPT‑4o‑mini consistently follows expected patterns, Gemma3 and Granite8B maintain sufficiency but falter under stricter interventions, and DeepSeek variants exhibit structural inconsistencies, indicating that explanation reliability varies across model families and sizes.

By Alisson Rosa Pereira, Bruno Iochins Grisci
arXiv Computation and Language
2d ago

FOLLIE: Automated Reasoning over the First Dataset of Sentences with their First-Order Logical Representation for French

FOLLIE is a new French natural language inference resource that links sentences to compositional first‑order logic representations, comprising 19,983 inference records and 36,987 sentence‑slot‑formula mappings derived from six heterogeneous NLI sources. The dataset’s silver annotations are generated by a neural‑symbolic pipeline, including 111 LLM‑assisted additions, and the construction integrates morphosyntactic analysis, probabilistic tagging, grammatical proof search, discourse representation, and first‑order semantic construction. An automated inference engine built on Prover9 and Mace4 achieves up to 71.35% accuracy on SICK‑FR, with high agreement rates on committed decisions, illustrating the resource’s utility for studying deductive inference in French.

By Maximos Skandalis
arXiv AI
Jun 16

VeriGraph: Towards Verifiable Data-Analytic Agents

arXiv:2606. 16603v1 Announce Type: cross Abstract: LLM-based agents have demonstrated strong capabilities in data-intensive analytical tasks, yet their outputs are rarely verifiable: a reliance on linear text trajectories makes their reasoning difficult to audit.

By Jiajie Jin, Zhao Yang, Wenle Liao, Yuyang Hu, Guanting Dong, Xiaoxi Li, Yutao Zhu, Zhicheng Dou
arXiv AI
Oct 27

NeSySpec: Neuro-Symbolic Technical Intelligence for Auditing Engineering Specifications with an Application to Aircraft

NeSySpec is a neuro‑symbolic audit framework that uses Logic Tensor Networks to evaluate engineering specifications, detect violations, identify altered fields, propose minimal corrections, and link image evidence to parts. It learns tolerances from real records and integrates all audit outputs into a single verification report. The system was validated on 107 aircraft types, achieving superior macro‑F1 scores and higher accuracy in diagnosing constraints and locating altered fields compared to existing methods.

By Pier Mattia Basciano, Gianvito Antenori, Cristiano Andolfi, Giovanni Farina, Salvatore Monteleone