Axiomatizing logics of fuzzy preferences using graded modalities

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F20%3A00522192" target="_blank" >RIV/67985807:_____/20:00522192 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.fss.2020.01.002" target="_blank" >http://dx.doi.org/10.1016/j.fss.2020.01.002</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.fss.2020.01.002" target="_blank" >10.1016/j.fss.2020.01.002</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Axiomatizing logics of fuzzy preferences using graded modalities

Popis výsledku v původním jazyce

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 et al.'s minimal modal logic over a finite and linearly ordered residuated lattice. We then define appropriate extensions on a multi-modal language with graded modalities, both for weak and strict preferences, and with truth-constants. Actually, the presence of truth-constants in the language allows us to show that the modal operators □ and ◇ of the minimal modal logic are inter-definable. Finally, we propose an axiomatic system for this logic in an extended language (where the preference modal operators are definable), and prove completeness with respect to the intended graded preference semantics.

Název v anglickém jazyce

Axiomatizing logics of fuzzy preferences using graded modalities

Popis výsledku anglicky

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 et al.'s minimal modal logic over a finite and linearly ordered residuated lattice. We then define appropriate extensions on a multi-modal language with graded modalities, both for weak and strict preferences, and with truth-constants. Actually, the presence of truth-constants in the language allows us to show that the modal operators □ and ◇ of the minimal modal logic are inter-definable. Finally, we propose an axiomatic system for this logic in an extended language (where the preference modal operators are definable), and prove completeness with respect to the intended graded preference semantics.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF17_050%2F0008361" target="_blank" >EF17_050/0008361: Rozvoj lidských zdrojů pro výzkum v teoretické informatice</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Fuzzy Sets and Systems

ISSN

0165-0114

e-ISSN

—

Svazek periodika

401

Číslo periodika v rámci svazku

15 December 2020

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

26

Strana od-do

163-188

Kód UT WoS článku

000580008600010

EID výsledku v databázi Scopus

2-s2.0-85078484080