A Modal Logic for Possibilistic Reasoning with Fuzzy Formal Contexts

• URL: http://arxiv.org/abs/2512.24980v1
• Date: Wed, 31 Dec 2025 17:27:36 GMT
• Title: A Modal Logic for Possibilistic Reasoning with Fuzzy Formal Contexts
• Authors: Prosenjit Howlader, Churn-Jung Liau,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency ($\boxminus$) modalities and its formulas are interpreted in fuzzy formal contexts based on possibility theory. We present its axiomatization that is \emph{sound} with respect to the class of all fuzzy context models. In addition, both the necessity and sufficiency fragments of the logic are also individually complete with respect to the class of all fuzzy context models. We highlight the expressive power of the logic with some illustrative examples. As a formal context is the basic construct of formal concept analysis (FCA), we generalize three main notions in FCA, i.e., formal concepts, object oriented concepts, and property oriented concepts, to their corresponding $c$-cut concepts in fuzzy formal contexts. Then, we show that our logical language can represent all three of these generalized notions. Finally, we demonstrate the possibility of extending our logic to reasoning with multi-relational fuzzy contexts, in which the Boolean combinations of different fuzzy relations are allowed.

Related papers

• Non-Monotonic S4F Standpoint Logic (Extended Version with Proofs) [1.0312968200748118]
  We propose a novel formalism called S4F Standpoint Logic.<n>It is capable of expressing multi-viewpoint, non-monotonic semantic commitments.
  arXiv  Detail & Related papers  (2025-11-13T16:14:23Z)
• 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)
• 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)
• 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)
• PVS Embeddings of Propositional and Quantified Modal Logic [0.0]
  This report describes embeddings of propositional and quantified modal logic in the PVS verification system. The resources of PVS allow this to be done in an attractive way that supports much of the standard syntax of modal logic.
  arXiv  Detail & Related papers  (2022-05-12T22:44:29Z)
• Transfinite Modal Logic: a Semi-quantitative Explanation for Bayesian Reasoning [1.6916260027701393]
  We introduce transfinite modal logic, which combines modal logic with ordinal arithmetic. We suggest that transfinite modal logic captures the essence of Bayesian reasoning in a rather clear and simple form.
  arXiv  Detail & Related papers  (2022-04-02T17:58:14Z)
• Quantification and Aggregation over Concepts of the Ontology [0.0]
  We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We present an extension of first-order logic to support such abstractions, and show that it allows writing expressions of knowledge that are elaboration tolerant.
  arXiv  Detail & Related papers  (2022-02-02T07:49:23Z)
• A conditional, a fuzzy and a probabilistic interpretation of self-organising maps [0.0]
  We establish a link between preferential semantics for description logics and self-organising maps. We show that a concept-wise multipreference semantics can be used to provide a logical interpretation of SOMs.
  arXiv  Detail & Related papers  (2021-03-11T18:31:00Z)
• Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
  We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
  arXiv  Detail & Related papers  (2020-08-06T02:13:11Z)
• Space of Reasons and Mathematical Model [8.475081627511166]
  Inferential relations govern our concept use. In order to understand a concept it has to be located in a space of implications. The crucial questions is: How can the conditionality of language use be represented.
  arXiv  Detail & Related papers  (2020-07-06T01:13:43Z)
• 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.