English
Related papers

Related papers: Kripke Semantics for Fuzzy Logics

200 papers

We present a construction of nondeterministic semantics for some deontic logics based on the class of paraconsistent logics known as Logics of Formal Inconsistency (LFIs), for the first time combining swap structures and Kripke models…

Logic in Computer Science · Computer Science 2025-06-09 Mahan Vaz , Marcelo E. Coniglio

I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…

Logic · Mathematics 2025-06-23 Antonio Piccolomini d'Aragona

This paper develops a category-theoretic approach to uncertainty, informativeness and decision-making problems. It is based on appropriate first order fuzzy logic in which not only logical connectives but also quantifiers have fuzzy…

General Mathematics · Mathematics 2007-05-23 P. V. Golubtsov , S. S. Moskaliuk

In this paper, we provide a Hilbert-style axiomatisation for the crisp bi-G\"{o}del modal logic $\KbiG$. We prove its completeness w.r.t.\ crisp Kripke models where formulas at each state are evaluated over the standard bi-G\"{o}del algebra…

Logic · Mathematics 2023-09-07 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko

With the rapid advancement of large language models (LLMs), natural language processing (NLP) has achieved remarkable progress. Nonetheless, significant challenges remain in handling texts with ambiguity, polysemy, or uncertainty. We…

Computation and Language · Computer Science 2025-09-29 Ping Chen , Xiang Liu , Zhaoxiang Liu , Zezhou Chen , Xingpeng Zhang , Huan Hu , Zipeng Wang , Kai Wang , Shuming Shi , Shiguo Lian

This paper establishes a dual theory about knowledge and argumentation. Our idea is rooted at both epistemic logic and argumentation theory, and we aim to merge these two fields, not just in a superficial way but to thoroughly disclose the…

Logic in Computer Science · Computer Science 2022-09-28 Xinyu Wang , Momoka Fujieda

The study of modal logic has witnessed tremendous development following the introduction of Kripke semantics. However, recent developments in programming languages and type theory have led to a second way of studying modalities, namely…

Logic in Computer Science · Computer Science 2024-05-09 G. A. Kavvos

Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning with) structured knowledge affected by vagueness. Although most of the not very expressive crisp DLs, such as ALC, enjoy the Finite…

Artificial Intelligence · Computer Science 2010-03-09 Fernando Bobillo , Felix Bou , Umberto Straccia

This paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi~Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what…

Programming Languages · Computer Science 2021-08-10 Pascual Julián-Iranzo , Fernando Sáenz-Pérez

\textbf{T-BAT} logic is a formal system designed to express the notion of informal provability. This type of provability is closely related to mathematical practice and is quite often contrasted with formal provability, understood as a…

Logic in Computer Science · Computer Science 2025-10-17 Pawel Pawlowski

In this paper, we discuss different models for human logic systems and describe a game with nature. G\"odel`s incompleteness theorem is taken into account to construct a model of logical networks based on axioms obtained by symmetry…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Fariel Shafee

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…

Logic · Mathematics 2025-05-02 Mikhail Rybakov

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

Logic in Computer Science · Computer Science 2015-09-25 Lauri Hella , Johanna Stumpf

Concept Bottleneck Models (CBMs) provide a basis for semantic abstractions within a neural network architecture. Such models have primarily been seen through the lens of interpretability so far, wherein they offer transparency by inferring…

Computer Vision and Pattern Recognition · Computer Science 2025-12-09 Deepika SN Vemuri , Gautham Bellamkonda , Aditya Pola , Vineeth N Balasubramanian

This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…

Logic in Computer Science · Computer Science 2008-12-16 Luigi Santocanale , Yde Venema

Fuzzy description logics serve the representation of vague knowledge, typically letting concepts take truth degrees in the unit interval. Expressiveness, logical properties, and complexity vary strongly with the choice of propositional…

Logic in Computer Science · Computer Science 2025-10-14 Stefan Gebhart , Lutz Schröder , Paul Wild

Dialectica categories are a very versatile categorical model of linear logic. These have been used to model many seemingly different things (e.g., Petri nets and Lambek's calculus). In this note, we expand our previous work on fuzzy petri…

Logic in Computer Science · Computer Science 2011-07-14 Apostolos Syropoulos , Valeria de Paiva

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of {\L}ukasiewicz propositional logic to query…

Logic in Computer Science · Computer Science 2015-12-04 Stefano Aguzzoli , Pietro Codara , Tommaso Flaminio , Brunella Gerla , Diego Valota

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak
‹ Prev 1 8 9 10 Next ›