Reasoning Systems as Structured Processes: Foundations, Failures, and Formal Criteria

• URL: http://arxiv.org/abs/2508.01763v1
• Date: Sun, 03 Aug 2025 14:04:15 GMT
• Title: Reasoning Systems as Structured Processes: Foundations, Failures, and Formal Criteria
• Authors: Saleh Nikooroo, Thomas Engel,
• Abstract summary: We model reasoning systems as structureds comprising phenomena, explanation space, inference and generation maps, and a principle base.<n>We survey basic internal criteria--including coherence, soundness, and completeness--and catalog typical failure modes such as contradiction, incompleteness, and non-convergence.<n>The goal of this work is to establish a foundational structure for representing and comparing reasoning systems, particularly in contexts where internal failure, adaptation, or fragmentation may arise.
• Score: 1.2064681974642195
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space, inference and generation maps, and a principle base. The formulation accommodates logical, algorithmic, and learning-based reasoning processes within a unified structural schema, while remaining agnostic to any specific reasoning algorithm or logic system. We survey basic internal criteria--including coherence, soundness, and completeness-and catalog typical failure modes such as contradiction, incompleteness, and non-convergence. The framework also admits dynamic behaviors like iterative refinement and principle evolution. The goal of this work is to establish a foundational structure for representing and comparing reasoning systems, particularly in contexts where internal failure, adaptation, or fragmentation may arise. No specific solution architecture is proposed; instead, we aim to support future theoretical and practical investigations into reasoning under structural constraint.

Related papers

• Towards a unified framework for programming paradigms: A systematic review of classification formalisms and methodological foundations [0.0]
  This systematic literature review maps the formal foundations of programming paradigms.<n>We find that existing lack conceptual granularity, a unified formal basis, and struggle with hybrid languages.<n>We conclude that the literature reflects a significant intellectual shift away from classification towards promising formal, reconstructive frameworks.
  arXiv  Detail & Related papers  (2025-08-01T11:19:40Z)
• Comprehension Without Competence: Architectural Limits of LLMs in Symbolic Computation and Reasoning [7.996731257791417]
  Large Language Models (LLMs) display striking surface fluency yet systematically fail at tasks requiring symbolic reasoning, arithmetic accuracy, and logical consistency.<n>This paper offers a structural diagnosis of such failures, revealing a persistent gap between textitcomprehension and textitcompetence<n>We term this phenomenon the computational textitsplit-brain syndrome, where instruction and action pathways are geometrically and functionally dissociated.
  arXiv  Detail & Related papers  (2025-07-14T04:01:45Z)
• 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)
• Information Science Principles of Machine Learning: A Causal Chain Meta-Framework Based on Formalized Information Mapping [1.145820303039203]
  This study focuses on addressing the current lack of a unified formal theoretical framework in machine learning.<n>universal definitions for model interpretability and ethical safety are proposed.<n>Three key theorems are proved: the equivalence of model interpretability and information recoverability, the assurance of ethical safety, and the estimation of generalization error.
  arXiv  Detail & Related papers  (2025-05-19T14:39:41Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• The Generative Programs Framework [0.0]
  We argue that any quantitative physical theory can be represented in the form of a generative program. We suggest that these graphs can be interpreted as encoding relations of ontological priority,' and that ontological priority is a suitable generalisation of causation.
  arXiv  Detail & Related papers  (2023-07-21T00:57:05Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs [67.043747188954]
  We propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs. It encodes linearized query structures and entities using pre-trained language models to find answers. We conduct experiments on two inductive logical reasoning datasets and three transductive datasets.
  arXiv  Detail & Related papers  (2023-05-23T01:25:29Z)
• Morpho-logic from a Topos Perspective: Application to symbolic AI [2.781492199939609]
  Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI) We propose to further develop and generalize this link between mathematical morphology and modal logic from a topos perspective. We show that the modal logic is well adapted to define concrete and efficient operators for revision, merging, and abduction of new knowledge, or even spatial reasoning.
  arXiv  Detail & Related papers  (2023-03-08T21:24:25Z)
• Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
  Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence) We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs) The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
  arXiv  Detail & Related papers  (2022-07-04T14:38:49Z)
• A General Framework for Consistent Structured Prediction with Implicit Loss Embeddings [113.15416137912399]
  We propose and analyze a novel theoretical and algorithmic framework for structured prediction. We study a large class of loss functions that implicitly defines a suitable geometry on the problem. When dealing with output spaces with infinite cardinality, a suitable implicit formulation of the estimator is shown to be crucial.
  arXiv  Detail & Related papers  (2020-02-13T10:30:04Z)

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.