English
Related papers

Related papers: Defeasible Modalities

200 papers

We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…

Logic · Mathematics 2022-06-15 Clarence Protin

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a…

Logic in Computer Science · Computer Science 2024-03-26 Wesley H. Holliday , Matthew Mandelkern

It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…

Logic in Computer Science · Computer Science 2008-12-17 Mladen Pavicic , Norman D. Megill

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

This article aims to present a neighborhood semantic for a modal logic, namely, propositional logic of the plausible. As a subnormal character modal logic, not admits a Kripke semantics. However, the authors show that this neighborhood…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…

Logic · Mathematics 2025-10-17 Tenyo Takahashi

In this paper we present a theorem proving methodology for a restricted but significant fragment of the conditional language made up of (boolean combinations of) conditional statements with unnested antecedents. The method is based on the…

Logic in Computer Science · Computer Science 2007-05-23 Alberto Artosi , Guido Governatori

Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/worlds -- maximal consistent sets of propositions -- with…

Logic · Mathematics 2016-10-18 Sergei Artemov

The purpose of this paper is to introduce justification logics based on conditional logics. We introduce a new family of logics, called conditional justification logics, which incorporates a counterfactual conditional in its language. For…

Logic · Mathematics 2025-01-17 Meghdad Ghari

The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…

Artificial Intelligence · Computer Science 2013-03-08 Judea Pearl

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…

Artificial Intelligence · Computer Science 2019-10-16 Niki Pfeifer

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…

Artificial Intelligence · Computer Science 2017-10-02 Jesse Heyninck , Christian Straßer , Pere Pardo

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

Logic in Computer Science · Computer Science 2023-06-23 Eben Blaisdell

The KLM approach to defeasible reasoning introduces a weakened form of implication into classical logic. This allows one to incorporate exceptions to general rules into a logical system, and for old conclusions to be withdrawn upon learning…

Artificial Intelligence · Computer Science 2024-10-08 Nicholas Leisegang , Thomas Meyer , Sebastian Rudolph