English
Related papers

Related papers: It ain't necessarily so: Basic sequent systems for…

200 papers

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that…

Artificial Intelligence · Computer Science 2022-05-17 How Khang Lim , Avishkar Mahajan , Martin Strecker , Meng Weng Wong

Deduction is the one of the major forms of inferences and commonly used in formal logic. This kind of inference has the feature of monotonicity, which can be problematic. There are different types of inferences that are not monotonic, e.g.…

Logic in Computer Science · Computer Science 2020-07-07 Florian Richter

This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…

Logic · Mathematics 2024-04-25 Nino Guallart

This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…

Artificial Intelligence · Computer Science 2020-01-15 Anthony Hunter , Sylwia Polberg , Matthias Thimm

This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of…

Logic · Mathematics 2007-05-23 K. Dosen , Z. Petric

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

This paper deals with classifying ambiguities for Multimodal Languages. It evolves the classifications and the methods of the literature on ambiguities for Natural Language and Visual Language, empirically defining an original…

Human-Computer Interaction · Computer Science 2017-04-11 Maria Chiara Caschera , Fernando Ferri , Patrizia Grifoni

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

Logic · Mathematics 2021-07-26 Asaf Karagila

This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences.…

Logic in Computer Science · Computer Science 2026-03-24 Fabio Vitali

We first establish several general properties of modality of algebraic group actions. In particular, we introduce the notion of a modality-regular action and prove that every visible action is modality-regular. Then, using these results, we…

Representation Theory · Mathematics 2017-07-26 Vladimir L. Popov

The so-called paradoxes of material implication have motivated the development of many non-classical logics over the years \cite{aA75,nB77,aA89,gP89,sH96}. In this note, we investigate some of these paradoxes and classify them, over minimal…

Logic · Mathematics 2016-06-28 Hannes Diener , Maarten McKubre-Jordens

This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and…

Logic · Mathematics 2014-12-01 Alex Citkin

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic…

Artificial Intelligence · Computer Science 2023-05-26 Maurizio Proietti , Francesca Toni

The concept of complementarity in combination with a non-Boolean calculus of propositions refers to a pivotal feature of quantum systems which has long been regarded as a key to their distinction from classical systems. But a non-Boolean…

Quantum Physics · Physics 2015-10-13 Harald Atmanspacher , Peter beim Graben

We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. The negation is interpreted as the dual, linear proofs are interpreted as…

Logic in Computer Science · Computer Science 2017-01-11 Marie Kerjean

We present an extension and generalization of Sahlqvist--Van Benthem correspondence to the case of distribution-free modal logic, with, or without negation and/or implication connectives. We follow a reductionist strategy, reducing the…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis , Hartonas