English
Related papers

Related papers: Hypersequents and the Proof Theory of Intuitionist…

200 papers

This paper is a continuation of our work concerning the logical and computational foundations of multi-step fuzzy inference. We bring further results on the implementation of the Mamdani-Assilian type of fuzzy rules and inference in Goedel…

Logic in Computer Science · Computer Science 2023-12-12 Dusan Guller

This paper addresses the logical and computational foundations of multi-step fuzzy inference using the Mamdani-Assilian type of fuzzy rules by implementing such inference in Goedel logic with truth constants. We apply the results achieved…

Logic in Computer Science · Computer Science 2023-12-04 Dusan Guller

This paper employs the linear nested sequent framework to design a new cut-free calculus LNIF for intuitionistic fuzzy logic--the first-order G\"odel logic characterized by linear relational frames with constant domains. Linear nested…

Logic in Computer Science · Computer Science 2020-10-06 Tim Lyon

First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…

Logic · Mathematics 2015-04-21 Matthias Baaz , Norbert Preining , Richard Zach

We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate…

Logic in Computer Science · Computer Science 2018-02-06 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…

Logic · Mathematics 2009-10-13 Marco B. Caminati

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:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

Many-valued logics in general, and fuzzy logics in particular, usually focus on a notion of consequence based on preservation of full truth, typical represented by the value 1 in the semantics given the real unit interval [0,1]. In a recent…

Logic · Mathematics 2025-10-08 Guillermo Badia , Ronald Fagin , Carles Noguera

Mediative Fuzzy Logic was conceived as a practical scheme for reconciling hesitant or conflicting assessments in fuzzy control and decision-making. However, its logical and semantic foundations remain underdeveloped, especially beyond…

Artificial Intelligence · Computer Science 2026-05-25 Oscar Montiel Ross

We present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…

Logic in Computer Science · Computer Science 2024-06-07 Tim S. Lyon

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Artificial Intelligence · Computer Science 2015-09-30 Stefan Borgwardt , Rafael Peñaloza

In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…

Logic in Computer Science · Computer Science 2021-10-22 Davide Castelnovo , Marino Miculan

Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…

Artificial Intelligence · Computer Science 2020-09-29 Ben Goertzel

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…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

To deal with uncertainty in reasoning, interval-valued logic has been developed. But uniform intervals cannot capture the difference in degrees of belief for different values in the interval. To salvage the problem triangular and…

Artificial Intelligence · Computer Science 2020-01-08 Sandip Paul , Kumar Sankar Ray , Diganta Saha

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

Artificial Intelligence · Computer Science 2013-01-31 Teresa Alsinet , Lluis Godo , Sandra Sandri

This paper proposes two kinds of fuzzy abductive inference in the framework of fuzzy rule base. The abductive inference processes described here depend on the semantic of the rule. We distinguish two classes of interpretation of a fuzzy…

Artificial Intelligence · Computer Science 2007-05-23 Nedra Mellouli , Bernadette Bouchon-Meunier

The prenex fragments of first-order infinite-valued Goedel logics are classified. It is shown that the prenex Goedel logics characterized by finite and by uncountable subsets of [0, 1] are axiomatizable, and that the prenex fragments of all…

Logic · Mathematics 2022-01-31 Matthias Baaz , Norbert Preining , Richard Zach

We use princiles of fuzzy logic to develop a general model representing several processes in a system's operation characterized by a degree of vagueness and/or uncertainy. Further, we introduce three altenative measures of a fuzzy system's…

Artificial Intelligence · Computer Science 2012-12-12 Michael Gr. Voskoglou

The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König
‹ Prev 1 2 3 10 Next ›