English
Related papers

Related papers: Deontic modality based on preference

200 papers

The logic of reason-based preference advanced in Osherson and Weinstein (2012) is extended to quantifiers. Basic properties of the new system are discussed.

Logic in Computer Science · Computer Science 2012-10-05 Daniel Osherson , Scott Weinstein

In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…

Logic in Computer Science · Computer Science 2026-05-01 Xavier Parent

A structure called a decision making problem is considered. The set of outcomes (consequences) is partially ordered according to the decision maker's preferences. The problem is how these preferences affect a decision maker to prefer one of…

Category Theory · Mathematics 2007-05-23 Victor V. Rozen , Grigori Zhitomirski

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Modal dependence logics are modal logics defined on the basis of team semantics and have the downward closure property. In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those…

Logic · Mathematics 2018-12-19 Fan Yang

This paper aims at providing a comprehensive solution to the archaic open problem: how to define semantics of three-valued modal logic with vivid intuitive picture, convincing philosophical justification as well as versatile practical…

Logic · Mathematics 2022-09-28 Xinyu Wang , Yang Song , Satoshi Tojo

We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…

Databases · Computer Science 2007-05-23 Jan Chomicki , Joyce Song

The present paper investigates consequence relations that are both non-monotonic and paraconsistent. More precisely, we put the focus on preferential consequence relations, i.e. those relations that can be defined by a binary preference…

Artificial Intelligence · Computer Science 2007-05-23 Jonathan Ben-Naim

The notion of preferences plays an important role in many disciplines including service robotics which is concerned with scenarios in which robots interact with humans. These interactions can be favored by robots taking human preferences…

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

In this paper, we present a link between preference-based and multiobjective sequential decision-making. While transforming a multiobjective problem to a preference-based one is quite natural, the other direction is a bit less obvious. We…

Artificial Intelligence · Computer Science 2017-01-04 Paul Weng

We propose and study a system whose dynamics are governed by predictions of its future states. General formalism and concrete examples are presented. We find that the dynamical characteristics depend on both how to shape predictions as well…

Other Condensed Matter · Physics 2007-05-23 Toru Ohira

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…

Logic in Computer Science · Computer Science 2019-11-18 Amanda Vidal , Francesc Esteva , Lluis Godo

In a ceteris-paribus semantics for deontic logic, a state of affairs where a larger set of prescriptions is respected is preferable to a state of affairs where some of them are violated. Conditional preference nets (CP-nets) are a compact…

Artificial Intelligence · Computer Science 2020-03-25 Roberta Calegari , Andrea Loreggia , Emiliano Lorini , Francesca Rossi , Giovanni Sartor

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

We study a subclass of POMDPs, called Deterministic POMDPs, that is characterized by deterministic actions and observations. These models do not provide the same generality of POMDPs yet they capture a number of interesting and challenging…

Artificial Intelligence · Computer Science 2012-05-14 Blai Bonet

Determinism and indeterminism in physical theories are reviewed and some broader implications of determinism are discussed.

History and Philosophy of Physics · Physics 2007-05-23 Robert C. Bishop

Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of deontic situations. To overcome this issue, we introduce novel justification logics as hyperintensional…

Logic in Computer Science · Computer Science 2023-08-14 Atefeh Rohani , Thomas Studer

Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review…

Artificial Intelligence · Computer Science 2018-01-17 Olivier Cailloux , Sébastien Destercke
‹ Prev 1 2 3 10 Next ›