From Knowledge to Conjectures: A Modal Framework for Reasoning about Hypotheses

• URL: http://arxiv.org/abs/2508.07304v1
• Date: Sun, 10 Aug 2025 11:37:49 GMT
• Title: From Knowledge to Conjectures: A Modal Framework for Reasoning about Hypotheses
• Abstract summary: This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning.<n>We show that conjectural logics rely on a principle, called Axiom C, that ensures that all established facts are preserved across hypothetical layers.<n>We also introduce a dynamic operation, $mathsfsettle(varphi)$, which formalizes the transition from conjecture to accepted fact.
• Score: 2.06682776181122
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: a modal system in which cognitive contexts extend known facts with hypothetical assumptions to explore their consequences. Unlike traditional doxastic and epistemic systems, conjectural logics rely on a principle, called Axiom C ($\varphi \rightarrow \Box\varphi$), that ensures that all established facts are preserved across hypothetical layers. While Axiom C was dismissed in the past due to its association with modal collapse, we show that the collapse only arises under classical and bivalent assumptions, and specifically in the presence of Axiom T. Hence we avoid Axiom T and adopt a paracomplete semantic framework, grounded in Weak Kleene logic or Description Logic, where undefined propositions coexist with modal assertions. This prevents the modal collapse and guarantees a layering to distinguish between factual and conjectural statements. Under this framework we define new modal systems, e.g., KC and KDC, and show that they are complete, decidable, and robust under partial knowledge. Finally, we introduce a dynamic operation, $\mathsf{settle}(\varphi)$, which formalizes the transition from conjecture to accepted fact, capturing the event of the update of a world's cognitive state through the resolution of uncertainty.

Related papers

• A Minimal $κ$--$τ$ Logic for Risk-Sensitive Abduction [0.0]
  This paper argues that in risk-sensitive domains, the timing of commitment is itself a governed decision.<n>We present a minimal $$--$$ logical framework built on two primitives.<n>The framework provides formal machinery for domains in which the distinction between highly likely and commit-worthy is operationally consequential.
  arXiv  Detail & Related papers  (2026-08-08T15:35:32Z)
• Belief Contraction in Dynamic Epistemic Logic [0.0]
  We introduce a mechanism for belief contraction defined directly on standard Kripke models.<n>We show that it satisfies some of the standard properties of belief contraction but not others.<n>We also define a more general dynamic logic that is an extension of standard DEL.
  arXiv  Detail & Related papers  (2026-06-30T15:53:55Z)
• Provenance-Enhanced Statements in Knowledge Graphs [0.08594140167290097]
  Provenance-enhanced statements of the form "according to $X$, $varphi$" are pervasive in contemporary knowledge graphs.<n>Current provenance models can record who asserted what, but they typically treat provenance as semantically neutral.<n>We introduce DEC, a framework that interprets provenance predicates as indicators of epistemic stance and groups provenance-homogeneous sets of statements into cognitive worlds.
  arXiv  Detail & Related papers  (2026-06-13T11:01:50Z)
• Provably Secure Agent Guardrail [89.79561918065122]
  Existing defense architectures rely on empirical semantic guardrails and probabilistic large model adjudicators.<n>This paper proposes a new security paradigm for agents based on the fundamental limitations of logical reasoning.
  arXiv  Detail & Related papers  (2026-05-28T02:12:41Z)
• Information as Maximum-Caliber Deviation: A bridge between Integrated Information Theory and the Free Energy Principle [51.56484100374058]
  This work proposes that information can be defined as the deviation $$ of realized dynamics from a constrained maximum-caliber (MaxCal) path ensemble over a finite time horizon.<n>Under this definition, each of the cause/effect repertoires central to IIT 3.0 emerge directly from MaxCal variational principles.<n>Information $$ is shown to be equivalent to prediction error under accompanying predictive coding models.
  arXiv  Detail & Related papers  (2026-05-03T07:22:55Z)
• Project Ariadne: A Structural Causal Framework for Auditing Faithfulness in LLM Agents [0.0]
  We introduce textbfProject Ariadne, a novel XAI framework to audit the causal integrity of agentic reasoning.<n>Unlike existing interpretability methods that rely on surface-level textual similarity, Project Ariadne performs textbfhard interventions ($do$-calculus) on intermediate reasoning nodes.<n>Our empirical evaluation of state-of-the-art models reveals a persistent textitFaithfulness Gap.
  arXiv  Detail & Related papers  (2026-01-05T18:05:29Z)
• Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds [55.2480439325792]
  This article develops a novel framework for modal logic based on the idea of stratified actualization.<n>Traditional Kripke semantics treat modal operators as quantification over fully determinate alternatives.<n>We propose a system Stratified Actualization Logic (SAL) in which modalities are indexed by levels of ontological stability, interpreted as admissibility.
  arXiv  Detail & Related papers  (2025-06-12T18:35:01Z)
• Rational Inference in Formal Concept Analysis [0.4499833362998487]
  Defeasible conditionals are a form of non-monotonic inference.<n>KLM framework defines a semantics for the propositional case of defeasible conditionals.
  arXiv  Detail & Related papers  (2025-04-07T20:15:20Z)
• Answering Causal Queries at Layer 3 with DiscoSCMs-Embracing Heterogeneity [0.0]
  This paper advocates for the Distribution-consistency Structural Causal Models (DiscoSCM) framework as a pioneering approach to counterfactual inference.
  arXiv  Detail & Related papers  (2023-09-17T17:01:05Z)
• A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
  We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
  arXiv  Detail & Related papers  (2023-07-28T11:26:26Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Belief, knowledge and evidence [0.0]
  We present a logical system that combines the well-known classical concepts of belief and knowledge with a concept of evidence. Inspired by citelewapal, we propose here a relational, frame-based semantics where belief and knowledge are not modeled via accessibility relations but directly as sets of propositions.
  arXiv  Detail & Related papers  (2023-04-03T18:20:02Z)
• A Robustness Analysis of Blind Source Separation [91.3755431537592]
  Blind source separation (BSS) aims to recover an unobserved signal from its mixture $X=f(S)$ under the condition that the transformation $f$ is invertible but unknown. We present a general framework for analysing such violations and quantifying their impact on the blind recovery of $S$ from $X$. We show that a generic BSS-solution in response to general deviations from its defining structural assumptions can be profitably analysed in the form of explicit continuity guarantees.
  arXiv  Detail & Related papers  (2023-03-17T16:30:51Z)
• Logical Satisfiability of Counterfactuals for Faithful Explanations in NLI [60.142926537264714]
  We introduce the methodology of Faithfulness-through-Counterfactuals. It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation. It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
  arXiv  Detail & Related papers  (2022-05-25T03:40:59Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.