arXiv Computation and Language By Maximos Skandalis

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

Read the original on arXiv Computation and Language →

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.

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
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 Computation and Language
2d ago

An Experimental Study of Hybrid Retrieval, NLI and Open-source LLMs for Scientific Claim Verification

The study evaluates hybrid retrieval, NLI, and open‑source LLMs for scientific claim verification. Using a benchmark of 2,035 claims, the authors compare a DeBERTa‑based NLI baseline with Llama 3.1, Qwen3, and Mistral LLMs, finding that Qwen3 achieves the highest Macro‑F1 score. A conservative fusion rule that labels a claim as Support or Contradict only when both models agree actually degrades performance, and error analysis reveals that disagreements often overturn correct LLM predictions.

By Lakshmi Narayanan P, Narenkarthik K, Naren Kumar C
arXiv Computation and Language
Aug 28

Neuro-symbolic PRM: Enhancing Scientific Reasoning via Structured Traces and Symbolic Verification

The paper introduces a neuro‑symbolic framework for scientific reasoning that separates symbolic validity and semantic groundedness. A deterministic symbolic verifier acts as a hard filter to guarantee syntactic and arithmetic correctness, while a Process Reward Model (PRM) is trained on verifier‑accepted steps to assess contextual grounding. The authors propose Counterfactual Symbolic Perturbation (CSP) to generate hard negative examples that pass the verifier but are logically flawed, enabling efficient PRM training and a verifier‑first constrained search at inference.

By Yuxin Zi, Cong Xu, Suparna Bhattacharya, Martin Foltin, Amit Sheth