This work constructs paired modal problems with identical premises and conjecture but different frame or domain conditions; automated reasoning verifies opposite labels and releases the formulas, oracle artifacts, countermodels, and responses.
Abstract
Reasoning about necessity and possibility depends on assumptions about accessibility between worlds and about which objects exist at each one. The same inference may therefore hold under one modal system and fail under another. Evaluating language models on such problems requires testing whether their judgments follow the stated semantics rather than a familiar logic. We construct paired modal problems with identical premises and conjecture but different frame or domain conditions; automated reasoning verifies opposite labels. A balanced core prevents the semantic condition alone from revealing the answer. On this core, four of five recent models perform below the condition-only baseline under direct prompting. Yet enabling reasoning mode raises DeepSeek V4 Flash from 4.4% to 88.1% on unchanged prompts. Following stipulated modal semantics thus depends strongly on inference mode as well as model identity. When frame conditions are omitted, models often agree but fit different familiar logics best. We release the formulas, oracle artifacts, countermodels, and responses.
NAFBench is introduced, a procedural generator of solver-certified instances spanning four semantic viewpoints: SLDNF, well-founded semantics (WFS), and credulous and skeptical reasoning under stable-model semantics, which studies which reading of negation large language models adopt by default and whether they can ove...
Qiming Bao, Agnieszka Mensfelt, Michael J. Witbrock et al.· 0 citations
A modular logical framework for both reasoning with and measuring inconsistency in propositional knowledge bases that captures several existing forms of inconsistency-tolerant reasoning, including entailment based on maximal satisfiable subsets and the minimally inconsistent Logic of Paradox.
Yakoub Salhi· Proceedings of the Thirty-Fi...· 0 citations
This work introduces Constraint Saturation Evaluation (CSE), a procedurally generated benchmark that systematically varies the number of simultaneous constraints (k), with every constraint scored by a deterministic, rule-based verifier and zero LLM-judge involvement.
This work study compound options connected by AND, OR, and NEITHER/NOR, introducing a framework that decomposes each option into atomic answers and scores contrastive hypotheses about each one, so the model never sees a compound option.
The paper introduces Epi-Logic, a conceptual framework for epistemic runtime control that couples the detection of schema dissonance, a graduated reduction of autonomy, and the auditable switch to a validated schema.
This method provides a new approach to propositionalizing some FOL sentences over infinite domains and testing the validity of inferences composed of them, and it may be applied to formal reasoning in mathematics and physics.
Pei-Feng Li· Communications in Humanities...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.