arXiv AI

AGM-like Paraconsistent Partial Meet Abductive Expansion Operation

arXiv:2607. 09729v1 Announce Type: new Abstract: In his 1996 doctoral thesis, Maurice Pagnucco created the first AGM-like abductive expansion operation.

Hugging Face Trending Papers
Jun 2

ZX-Calculus:Trace-Indexed Dependent Types and Epistemic Semantics

We propose ZX-Calculus (Knowledge Evolution Calculus), a conservative extension of Martin-Lof Dependent Type Theory (MLTT) integrating trace-indexed types, presheaf non-monotone semantics, and constructive AGM belief revision. A Coq mechanisation accompanies the paper (34 complete proofs; zero admits for the two central results).

arXiv AI
Aug 28

Do Language Models Follow Occam's Razor? An Evaluation of Parsimony in Inductive and Abductive Reasoning

The paper investigates whether large language models (LLMs) follow Occam's Razor when performing inductive and abductive reasoning. It introduces a synthetic framework for generating questions that require both types of reasoning and a new automated metric to evaluate the simplicity and correctness of generated hypotheses. Experiments show that while LLMs can handle simple scenarios, they struggle with complex world models and producing high‑quality, simplest hypotheses, even when using advanced reasoning techniques.

By Yunxin Sun, Abulhair Saparov
arXiv Computation and Language
Sep 11

The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation

The paper introduces a semantic elevation operator that transforms static semantic questions about a program into dynamic questions about whether a property is preserved after the program rewrites itself. It proves that for intensional transformations the elevated property remains undecidable, showing that the class of non‑verifiable properties is closed under this operator and that repeated application climbs the arithmetical hierarchy to Υ02‑completeness. The work also demonstrates that no finite tower of verifiers can provide an unconditional certificate of preservation, and suggests a categorical perspective for future exploration.

By Jose Pascual Gumbau Mezquita
arXiv AI
Jul 1

Belief Contraction in Dynamic Epistemic Logic

arXiv:2606. 31861v1 Announce Type: cross Abstract: Dynamic epistemic logic represents belief change via model transformations induced by epistemic events.

By Gaia Belardinelli (Stanford University), Snow Zhang (University of Berkeley, California)
arXiv Computation and Language
Sep 16

Autoformalizing Argumentative Material Inferences

The paper introduces GUARD, a neuro‑symbolic system that autoformalizes argumentative material by completing missing premises (guards) before formal verification. It uses large language models to generate candidate guards, Isabelle/HOL to verify them, and a contrastive test to ensure the proof depends on the original premises and does not over‑generalize. Experiments on Debatepedia and ARCT show that GUARD improves verified‑faithful scores by over 30 points and reduces leakage by about 20 points compared to prior LLM‑driven theorem proving methods.

By Xin Quan, Reto Gubelmann, Andr\'e Freitas
arXiv AI
Jun 9

Standpoint Logics with Defeasible Beliefs

arXiv:2606. 08503v1 Announce Type: new Abstract: In this paper, we integrate the defeasible logic of Kraus, Lehmann and Magidor (KLM) with the standpoint logic framework of G\'omez \'Alvarez and Rudolph.

By Nicholas Leisegang, Thomas Meyer, Sebastian Rudolph