Lexicographic Logic: a Many-valued Logic for Preference Representation

12/20/2020
by   Angelos Charalambidis, et al.
0

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences, most notably lexicographic ones. The proposed logic supports a simple new connective whose semantics can be defined in terms of finite lists of truth values. We demonstrate that, despite the well-known theoretical limitations that pose barriers to the quantitative representation of lexicographic preferences, there exists a subset of the rational numbers over which the proposed new connective can be naturally defined. Lexicographic logic can be used to define in a simple way some well-known preferential operators, like "A and if possible B", and "A or failing that B". Moreover, many other hierarchical preferential operators can be defined using a systematic approach. We argue that the new logic is an effective formalism for ranking query results according to the satisfaction level of user preferences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2022

Time and Gödel: Fuzzy temporal reasoning in PSPACE

We investigate a non-classical version of linear temporal logic whose pr...
research
09/26/2022

Truth and Preferences – A Game Approach for Qualitative Choice Logic

In this paper, we introduce game-theoretic semantics (GTS) for Qualitati...
research
03/20/2013

Truth as Utility: A Conceptual Synthesis

This paper introduces conceptual relations that synthesize utilitarian a...
research
11/14/2019

A Dynamic Preference Logic for reasoning about Agent Programming

In this work, we investigate the use of Dynamic Preference Logic to enco...
research
09/17/2019

Axiomatizing logics of fuzzy preferences using graded modalities

The aim of this paper is to propose a many-valued modal framework to for...
research
08/07/2021

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...
research
04/26/2022

Skyline Operators and Regret Minimization Techniques for Managing User Preferences in the Query Process

The problem of selecting the most representative tuples from a dataset h...

Please sign up or login with your details

Forgot password? Click here to reset