Non-Monotonic S4F Standpoint Logic (Extended Version with Proofs)

• URL: http://arxiv.org/abs/2511.10449v2
• Date: Sun, 16 Nov 2025 09:17:33 GMT
• Title: Non-Monotonic S4F Standpoint Logic (Extended Version with Proofs)
• Authors: Piotr Gorczyca, Hannes Strass,
• Abstract summary: We propose a novel formalism called S4F Standpoint Logic.<n>It is capable of expressing multi-viewpoint, non-monotonic semantic commitments.
• Score: 1.0312968200748118
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the modal logic S4F. In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and standpoint propositional logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.

Related papers

• Logic-Parametric Neuro-Symbolic NLI: Controlling Logical Formalisms for Verifiable LLM Reasoning [13.291627429657412]
  We propose a logic-parametric framework for neuro-symbolic natural language inference.<n>We embed a range of classical and non-classical formalisms into higher-order logic.<n>We show that logic-internal strategies can consistently improve performance.
  arXiv  Detail & Related papers  (2026-01-09T10:47:30Z)
• A Modal Logic for Possibilistic Reasoning with Fuzzy Formal Contexts [0.0]
  We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts.<n>The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($Box$) and sufficiency ($boxminus$) modalities.<n>We show that our logical language can represent all three of these generalized notions.
  arXiv  Detail & Related papers  (2025-12-31T17:27:36Z)
• Non-Interactive Symbolic-Aided Chain-of-Thought for Logical Reasoning [4.839520296557773]
  Symbolic-Aided Chain-of-Thought (CoT) is an improved approach to logical reasoning in large language models (LLMs)<n>CoT integrates lightweight symbolic representations into few-shot prompts.<n>Experiments on four well-known logical reasoning benchmarks demonstrate the effectiveness of the proposed approach.
  arXiv  Detail & Related papers  (2025-08-17T16:32:05Z)
• Learning to Reason via Mixture-of-Thought for Logical Reasoning [56.24256916896427]
  Mixture-of-Thought (MoT) is a framework that enables LLMs to reason across three complementary modalities: natural language, code, and truth-table.<n>MoT adopts a two-phase design: (1) self-evolving MoT training, which jointly learns from filtered, self-generated rationales across modalities; and (2) MoT inference, which fully leverages the synergy of three modalities to produce better predictions.
  arXiv  Detail & Related papers  (2025-05-21T17:59:54Z)
• 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)
• Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming [11.215352918313577]
  Approximation fixpoint theory is a framework for studying the semantics of nonmonotonic logics. We extend AFT to dealing with non-deterministic constructs that allow to handle indefinite information. The applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming.
  arXiv  Detail & Related papers  (2022-11-30T18:58:32Z)
• MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
  We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios. Based on the multi-hop chain of reasoning, the explanation form includes three main components. We evaluate the current best models' performance on this new explanation form.
  arXiv  Detail & Related papers  (2022-10-22T16:01:13Z)
• 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)
• How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic [2.9005223064604073]
  Standpoint Logic is a simple, yet versatile multi-modal logic add-on'' for existing KR languages. We provide a polytime translation into the standpoint-free version of First-Order Standpoint Logic. We then establish a similar translation for the very expressive description logic SROIQb_s underlying the OWL 2 DL language.
  arXiv  Detail & Related papers  (2022-06-14T12:29:08Z)
• A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
  We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
  arXiv  Detail & Related papers  (2021-10-18T10:45: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.