English
Related papers

Related papers: Doxastic Lukasiewicz Logic with Public Announcemen…

200 papers

In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…

In this paper we introduce the convex fragment of {\L}ukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any…

Logic in Computer Science · Computer Science 2018-11-08 Francesco Giannini , Michelangelo Diligenti , Marco Gori , Marco Maggini

Dynamic Epistemic Logic extends classical epistemic logic by modeling not only static knowledge but also its evolution through information updates. Among its various systems, Public Announcement Logic (PAL) provides one of the simplest and…

Logic in Computer Science · Computer Science 2026-05-18 Clara Lerouvillois , Francesca Poggiolesi

We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…

Logic · Mathematics 2021-06-11 Wesley Fussner , William Zuluaga Botero

Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete axiomatisations has so far been an open problem. In this…

Logic in Computer Science · Computer Science 2011-07-04 Thomas Ågotnes , Natasha Alechina

Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$. In this…

Logic in Computer Science · Computer Science 2017-03-10 Steffen Lewitzka

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…

Logic in Computer Science · Computer Science 2023-08-01 Samuel Bucheli , Roman Kuznets , Thomas Studer

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition…

Logic in Computer Science · Computer Science 2007-05-23 Victor Makarov

The logics RL, RP, and RG have been obtained by expanding Lukasiewicz logic L, product logic P, and G\"odel--Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions,…

Logic · Mathematics 2021-08-09 J. Gispert , Z. Haniková , T. Moraschini , M. Stronkowski

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

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

Problems in two axiomatizations of Ja\'skowski's discussive (or discursive) logic D2 are considered. A recent axiomatization of D2 and completeness proof relative to D2's intended semantics seems to be mistaken because some formulas valid…

Logic · Mathematics 2014-04-01 Jesse Alama

Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only…

Logic in Computer Science · Computer Science 2013-10-29 Guillaume Aucher , Francois Schwarzentruber

Fuzzy logic extends the classical truth values "true" and "false" with additional truth degrees in between. More specifically, fuzzy modal logics in this sense are given by a choice of fuzzy modalities and a fuzzy propositional base. It has…

Logic in Computer Science · Computer Science 2026-02-13 Stefan Gebhart , Lutz Schröder , Paul Wild

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

Artificial Intelligence · Computer Science 2016-08-30 Van Hung Le

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

The paper investigates the properties of a fuzzy logic of typicality. The extension of fuzzy logic with a typicality operator was proposed in recent work to define a fuzzy multipreference semantics for Multilayer Perceptrons, by regarding…

Artificial Intelligence · Computer Science 2021-07-15 Laura Giordano