English
Related papers

Related papers: Deontic modality based on preference

200 papers

In this chapter we study modal logics of topological spaces in the combined language with the derivational modality and the difference modality. We give axiomatizations and prove completeness for the following classes: all spaces,…

Logic · Mathematics 2014-05-27 Andrey Kudinov , Valentin Shehtman

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the…

Artificial Intelligence · Computer Science 2014-09-19 Ulrich Furbach , Claudia Schon

Starting with the deontic principles in M\={\i}m\=a\d{m}s\=a texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this logic, resulting in decidability, complexity results…

Logic in Computer Science · Computer Science 2017-05-10 Agata Ciabattoni , Elisa Freschi , Francesco A. Genco , Björn Lellmann

This article deals with the interrelation of deontic operators in contracts -- an aspect often neglected when considering only one of the involved parties. On top of an automata-based semantics we formalise the onuses that obligations,…

Logic in Computer Science · Computer Science 2012-09-12 Gordon J. Pace , Fernando Schapachnik

Within social simulation, we often want agents to interact both with larger systems of norms, as well as respond to their own and other agents norm violations. However, there are currently no norm specifications that allow us to interact…

Logic in Computer Science · Computer Science 2022-05-23 René Mellema , Frank Dignum

The formalization of action and obligation using logic languages is a topic of increasing relevance in the field of ethics for AI. Having an expressive syntactic and semantic framework to reason about agents' decisions in moral situations…

Logic in Computer Science · Computer Science 2021-06-23 Aldo Iván Ramírez Abarca , Jan Broersen

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…

Optimization and Control · Mathematics 2007-05-23 Pavel Chebotarev , Elena Shamis

The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…

Artificial Intelligence · Computer Science 2022-09-27 Francesco Olivieri , Guido Governatori , Matteo Cristani , Antonino Rotolo , Abdul Sattar

This paper investigates the problem of finding a preference relation on a set of acts from the knowledge of an ordering on events (subsets of states of the world) describing the decision-maker (DM)s uncertainty and an ordering of…

Artificial Intelligence · Computer Science 2013-02-08 Didier Dubois , Helene Fargier , Henri Prade

We show that probabilistic equivalence of a regret-based preference relationship over random variables is implied by a weak form of continuity and monotonicity.

Theoretical Economics · Economics 2024-09-27 Sushil Bikhchandani , Uzi Segal

A mathematical model of Subject behaviour choice is proposed. The background of the model is the concept of two preference relations determining Subject behaviour. These are an "internal" or subjective preference relation and an "external"…

Logic · Mathematics 2025-10-20 Valeriy K. Bulitko

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Logic · Mathematics 2019-02-01 Rob Egrot

Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This papers extends previous statistical models to class-to-class preferences, and presents…

Computation and Language · Computer Science 2007-05-23 E. Agirre , D. Martinez

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

Logic · Mathematics 2025-05-13 Jialiang Yan , Qingyu He

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

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

In a seminal work, K. Segerberg introduced a deontic logic called DAL to investigate normative reasoning over actions. DAL marked the beginning of a new area of research in Deontic Logic by shifting the focus from deontic operators on…

Logic in Computer Science · Computer Science 2025-02-20 Carlos Areces , Valentin Cassano , Pablo Castro , Raul Fervari

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é

The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality…

Artificial Intelligence · Computer Science 2009-03-12 Denis Mindolin , Jan Chomicki