English
Related papers

Related papers: Non-expansive Fuzzy ALC

200 papers

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

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

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

The problem of minimizing fuzzy interpretations in fuzzy description logics (FDLs) is important both theoretically and practically. For instance, fuzzy or weighted social networks can be modeled as fuzzy interpretations, where individuals…

Data Structures and Algorithms · Computer Science 2026-02-05 Linh Anh Nguyen

This paper proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this paper we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and…

Logic · Mathematics 2021-03-15 Marcelo Coniglio , Francesc Esteva , Lluís Godo

This paper proposes a connection method \`a la Bibel for an exception-tolerant family of description logics (DLs). As for the language, we assume the DL $\mathcal{ALCH}$ extended with two typicality operators: one on (complex) concepts and…

Logic in Computer Science · Computer Science 2023-06-23 Renan Fernandes , Fred Freitas , Ivan Varzinczak , Pedro PM Farias

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Logic in Computer Science · Computer Science 2016-02-22 Kaustuv Chaudhuri

Recently, the description logic LE-ALC was introduced for reasoning in the semantic environment of the enriched formal contexts, and a tableaux algorithm was developed for checking the consistency of ABoxes in this logic. In this paper, we…

Logic in Computer Science · Computer Science 2025-06-09 Krishna Manoorkar , Ruoding Wang

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…

Logic in Computer Science · Computer Science 2007-05-23 G. Metcalfe , N. Olivetti , D. Gabbay

A fuzzy multipreference semantics has been recently proposed for weighted conditional knowledge bases, and used to develop a logical semantics for Multilayer Perceptrons, by regarding a deep neural network (after training) as a weighted…

Artificial Intelligence · Computer Science 2021-10-27 Laura Giordano

Fuzzy answer set programming is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set…

Artificial Intelligence · Computer Science 2013-04-09 Emad Saad

In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and representing vague knowledge. Formulas are represented by pairs (A, c), where A is a many-valued proposition and c is…

Artificial Intelligence · Computer Science 2013-01-18 Teresa Alsinet , Lluis Godo

This paper presents a Prolog-based reasoning module to generate counterfactual explanations given the predictions computed by a black-box classifier. The proposed symbolic reasoning module can also resolve what-if queries using the…

Machine Learning · Computer Science 2022-11-21 Gonzalo Nápoles , Fabian Hoitsma , Andreas Knoben , Agnieszka Jastrzebska , Maikel Leon Espinosa

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

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

In this paper we study intermediate logics between the degree preserving companion of Godel fuzzy logic with an involution and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts.…

Logic in Computer Science · Computer Science 2026-01-14 M. E. Coniglio , F. Esteva , J. Gispert , L. Godo

Incomplete information is a problem in many aspects of actual environments. Furthermore, in many sceneries the knowledge is not represented in a crisp way. It is common to find fuzzy concepts or problems with some level of uncertainty.…

Programming Languages · Computer Science 2007-05-23 Susana Munoz-Hernandez , Claudio Vaucheret

Combining symbolic and neural approaches has gained considerable attention in the AI community, as it is often argued that the strengths and weaknesses of these approaches are complementary. One such trend in the literature are weakly…

Artificial Intelligence · Computer Science 2020-06-08 Emile van Krieken , Erman Acar , Frank van Harmelen

In fuzzy propositional logic, to a proposition a partial truth in [0,1] is assigned. It is well known that under certain circumstances, fuzzy logic collapses to classical logic. In this paper, we will show that under dual conditions, fuzzy…

Artificial Intelligence · Computer Science 2007-05-23 Umberto Straccia