中文
相关论文

相关论文: Possibilistic semantics for a modal KD45 extension…

200 篇论文

In this paper, we provide simplified semantics for the logic K45(G), i.e. the many-valued Godel counterpart of the classical modal logic K45. More precisely, we characterize K45(G) as the set of valid formulae of the class of possibilistic…

逻辑 · 数学 2021-05-17 Ricardo Rodriguez , Olim Tuyt , Lluis Godo , Francesc Esteva

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

计算机科学中的逻辑 · 计算机科学 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic. The calculi are used to establish…

逻辑 · 数学 2015-07-01 George Metcalfe , Nicola Olivetti

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

人工智能 · 计算机科学 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…

逻辑 · 数学 2025-01-01 Vladislav Sliusarev

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

逻辑 · 数学 2025-01-22 Wesley H. Holliday

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

计算机科学中的逻辑 · 计算机科学 2011-03-02 Zoran Majkic

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

人工智能 · 计算机科学 2013-04-05 Enrique H. Ruspini

In this paper we prove soundness and completeness of some epistemic extensions of G\"odel fuzzy logic, based on Kripke models in which both propositions at each state and accessibility relations take values in [0,1]. We adopt belief as our…

逻辑 · 数学 2024-03-05 D. Dastgheib , H. Farahani , A. H. Sharafi

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

逻辑 · 数学 2009-11-13 Sérgio Marcelino , Pedro Resende

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

逻辑 · 数学 2021-09-07 Nicholas Pischke

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

计算机科学中的逻辑 · 计算机科学 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár

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…

计算机科学中的逻辑 · 计算机科学 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

计算机科学中的逻辑 · 计算机科学 2025-01-03 Amir Karniel , Michael Kaminski

Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…

逻辑 · 数学 2019-07-02 Parvin Safari , Saeed Salehi

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

逻辑 · 数学 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

逻辑 · 数学 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

逻辑 · 数学 2007-05-23 Georges Hansoul , Bruno Teheux

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

计算机科学中的逻辑 · 计算机科学 2019-01-01 Anantha Padmanabha , R Ramanujam

We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with $1$ interpreted as "entirely plausible for the agent" and $0$ as "completely implausible" (i.e., the…

逻辑 · 数学 2025-12-18 Marta Bílková , Thomas Ferguson , Daniil Kozhemiachenko
‹ 上一页 1 2 3 10 下一页 ›