English
Related papers

Related papers: A Modal Logic of Supervenience

200 papers

We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a…

Artificial Intelligence · Computer Science 2016-08-31 Samir Chopra , Konstantinos Georgatos , Rohit Parikh

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be…

Artificial Intelligence · Computer Science 2021-02-16 Michael Maher

We introduce the operation of possibility qualification and show how. this modal-like operator can be used to represent "typical" or default knowledge in a theory of nonmonotonic reasoning. We investigate the representational power of this…

Artificial Intelligence · Computer Science 2013-04-10 Ronald R. Yager

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

Logic in Computer Science · Computer Science 2014-02-20 Julio Lemos

One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…

Logic in Computer Science · Computer Science 2021-12-30 Jian Zhang

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

Intercausal reasoning is a common inference pattern involving probabilistic dependence of causes of an observed common effect. The sign of this dependence is captured by a qualitative property called product synergy. The current definition…

Artificial Intelligence · Computer Science 2013-03-08 Marek J. Druzdzel , Max Henrion

The basic system E of dyadic deontic logic proposed by {\AA}qvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a…

Logic in Computer Science · Computer Science 2024-06-14 Agata Ciabattoni , Nicola Oliveti , Xavier Parent

In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define…

Logic in Computer Science · Computer Science 2014-05-07 Shahab Tasharrofi , Eugenia Ternovska

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

Logic in Computer Science · Computer Science 2025-12-23 Mario Piazza , Andrea Sabatini

Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativity causing the complexity of cut-elimination to be…

Logic in Computer Science · Computer Science 2008-10-17 Ugo Dal Lago , Luca Roversi , Luca Vercelli

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

Logic · Mathematics 2026-05-15 Amanda Vidal

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

Logic in Computer Science · Computer Science 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction axioms, thereby establishing decidability. We also prove…

Logic in Computer Science · Computer Science 2021-05-04 Joseph Boudou , Andreas Herzig , Nicolas Troquard

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto
‹ Prev 1 8 9 10 Next ›