arXiv Computation and Language

Natural Language to First-Order Logic LLM-based Autoformalization

The paper introduces a clear definition for the task of converting natural language into First‑Order Logic (FOL), separating ontology extraction from logical translation to improve evaluation consistency. It surveys current datasets, evaluation metrics, and LLM‑based approaches—including fine‑tuning, prompting, and verification‑based refinement. The authors also outline remaining challenges in benchmarking, semantic evaluation, ontology‑aware methods, and practical applications.

arXiv Machine Learning
Jul 21

LogicIF: Towards Complex Logic Instruction Following

arXiv:2508. 09125v3 Announce Type: replace-cross Abstract: Instruction following has catalyzed the recent era of Large Language Models (LLMs) and is the foundational skill underpinning more advanced capabilities such as reasoning and agentic behaviors.

By Mian Zhang, Shujian Liu, Sixun Dong, Ming Yin, Yebowen Hu, Xun Wang, Simin Ma, Song Wang, Sathish Reddy Indurthi, Haoyun Deng, Zhiyu Zoey Chen, Kaiqiang Song
arXiv AI
Oct 23

When Form Changes but Logic Doesn't: Building Logic-invariant LLMs through Logical Structure

The paper investigates whether large language models (LLMs) truly grasp logical structure or merely rely on surface semantics. By evaluating models on logically equivalent inputs, the authors find that many LLMs fail to produce consistent predictions and struggle with unseen logical forms. They introduce LoGIST, a framework that maps inputs to decision diagrams and uses these logical embeddings to guide LLM reasoning, thereby reducing inconsistency and improving generalization.

By Xuyuan Liu, Xinshuai Dong, Elynn Chen, Yujun Yan
arXiv AI
Jul 23

Logic-Guided Data Extraction with Answer Set Programming and Large Language Models

arXiv:2607. 19365v1 Announce Type: new Abstract: When Large Language Models (LLMs) are used for semantic data extraction from unstructured text, producing candidate relational facts from natural language, they may remain unreliable for tasks requiring complex combinatorial reasoning and global consistency.

By Mario Alviano, Lorenzo Grillo, Nicola Leone, Fabrizio Lo Scudo
arXiv Computation and Language
Aug 24

Beyond Gold Standards: Epistemic Ensemble of LLM Judges for Formal Mathematical Reasoning

The paper introduces an epistemically and formally grounded ensemble (EFG) of large language model judges to evaluate autoformalization tasks in formal mathematics. It defines four criteria—logical preservation, mathematical consistency, formal quality, and formal validity—to provide a transparent, multi‑granular assessment. Experiments show that this ensemble outperforms coarse‑grained models, offering a scalable and interpretable proxy for evaluating formal mathematical reasoning.

By Lan Zhang, Marco Valentino, Jordan Meadows, Andre Freitas
arXiv Computation and Language
Sep 21

When Does Reasoning Help in Machine Translation? A Hierarchical Analysis of LRM Reasoning Traces

The paper investigates when intermediate reasoning traces benefit machine translation by examining models, languages, domains, and datasets. It finds that the optimal reasoning language depends on the model, reasoning length has a non‑monotonic effect on quality, and traces display recurring functional patterns. Using Hierarchical Meta‑Summarization, the authors uncover a shared structure of understanding/planning, translating/drafting, and refining/verifying, while also noting domain‑specific variations, suggesting that reasoning should be tailored rather than uniformly applied.

By Yuxiang Liu, Jiaming Luo, Eleftheria Briakou, Colin Cherry
arXiv Machine Learning
Sep 14

GLaMoR: Consistency Checking of OWL Ontologies using Graph Language Models

The paper introduces GLaMoR, a reasoning pipeline that converts OWL ontologies into graph-structured data and applies a Graph Language Model (GLM) for consistency checking. It addresses the challenge of verifying ontology consistency, especially for large ontologies where classical reasoners become computationally expensive. Experiments on NCBO BioPortal ontologies show that GLaMoR achieves 95% accuracy and is 20 times faster than traditional reasoners.

By Justin M\"ucke, Ansgar Scherp