English
Related papers

Related papers: The Modal Cube Revisited: Semantics without Worlds…

200 papers

Substitutions play a crucial role in a wide range of contexts, from analyzing the dynamics of social opinions and conducting mathematical computations to engaging in game-theoretical analysis. For many situations, considering one-step…

Logic · Mathematics 2025-08-01 Yaxin Tu , Sujata Ghosh , Fenrong Liu , Dazhu Li

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

In semantic segmentation, generalizing a visual system to both seen categories and novel categories at inference time has always been practically valuable yet challenging. To enable such functionality, existing methods mainly rely on either…

Computer Vision and Pattern Recognition · Computer Science 2024-07-12 Yuhuan Yang , Chaofan Ma , Chen Ju , Fei Zhang , Jiangchao Yao , Ya Zhang , Yanfeng Wang

We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an…

Logic in Computer Science · Computer Science 2024-05-02 Ezra Schoen , Clemens Kupke , Jurriaan Rot , Ruben Turkenburg

This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated…

Logic · Mathematics 2009-10-02 Felix Bou , Francesc Esteva , Lluis Godo , Ricardo Rodriguez

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more…

Artificial Intelligence · Computer Science 2007-05-23 Pascal Hitzler , Matthias Wendt

We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we…

Artificial Intelligence · Computer Science 2022-02-16 Giovanni Casini , Umberto Straccia

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…

Artificial Intelligence · Computer Science 2020-09-07 Laura Giordano , Daniele Theseider Dupré

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

There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…

Logic in Computer Science · Computer Science 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

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…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…

Logic in Computer Science · Computer Science 2024-11-26 Victoria Vollmer , Danielle Marshall , Harley Eades , Dominic Orchard

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…

Computation and Language · Computer Science 2010-12-15 Maxime Amblard , Alain Lecomte , Christian Retoré

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…

Logic in Computer Science · Computer Science 2012-09-12 Alejandro Díaz-Caro , Barbara Petit

In this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…

Logic in Computer Science · Computer Science 2022-10-25 Chun-Yu Lin , Churn-Jung Liau

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins
‹ Prev 1 3 4 5 6 7 10 Next ›