Maya Olszewski

dblp:231/8799 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0001-9926-058XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2024 Permissive and regulative norms in deontic logic
abstract
Abstract This article provides a systematic analysis of the well-known notions of weak and strong permission in input/output (I/O) logic. We extend the account of permission initially put forward by Makinson and Van der Torre to the whole family of I/O systems developed during the last two decades. The main contribution is a series of characterization results for strong permission, based on establishing the so-called non-repetition property. We also study an input/output logic not yet covered in the literature. It supports reasoning by cases—a natural feature of human reasoning. The output is not closed under logical entailment. At the same time, it avoids excess output using a consistency check—a technique familiar from non-monotonic logic. This makes it well suited for contrary-to-duty reasoning. The axiomatic characterization is in terms of a generalized OR rule. We discuss the implications of all this for our understanding of the notion of the coherence of a normative system. Topics for future research are identified.1
Maya Olszewski, Xavier Parent 0001, Leon van der Torre
J. Log. Comput.1
2018 Visualizing the Template of a Chaotic Attractor
Maya Olszewski, Jeff Meder, Emmanuel Kieffer, Raphaël Bleuse, Martin Rosalie, Grégoire Danoy, Pascal Bouvry
GD1