Relating Preference Languages By Their Expressive Power

There has been a great deal of research into methods for representing preferences, called preference representation languages. Often, research in this area deals with a limited number of similar languages, in isolation. This work establishes a new method of analyzing the similarity of different lang...

Full description

Saved in:
Bibliographic Details
Main Authors: Michael Andrew Huelsman, Miroslaw Truszczynski
Format: Article
Language:English
Published: LibraryPress@UF 2022-05-01
Series:Proceedings of the International Florida Artificial Intelligence Research Society Conference
Subjects:
Online Access:https://journals.flvc.org/FLAIRS/article/view/130651
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849763362707079168
author Michael Andrew Huelsman
Miroslaw Truszczynski
author_facet Michael Andrew Huelsman
Miroslaw Truszczynski
author_sort Michael Andrew Huelsman
collection DOAJ
description There has been a great deal of research into methods for representing preferences, called preference representation languages. Often, research in this area deals with a limited number of similar languages, in isolation. This work establishes a new method of analyzing the similarity of different languages by considering the class of preference orders that each language is capable of expressing. Our method involves the definition of a relation called preference representation language subsumption, which allows us to relate various languages by their expressive power. We demonstrate several general proof techniques for showing that such a relation exists or does not exist. Additionally, we provide a small case study for several languages that express preferences over combinatorial domains and discuss several analytical uses for the proposed subsumption relation.
format Article
id doaj-art-a5e631f7c8d04f2584fce382cba9347a
institution DOAJ
issn 2334-0754
2334-0762
language English
publishDate 2022-05-01
publisher LibraryPress@UF
record_format Article
series Proceedings of the International Florida Artificial Intelligence Research Society Conference
spelling doaj-art-a5e631f7c8d04f2584fce382cba9347a2025-08-20T03:05:26ZengLibraryPress@UFProceedings of the International Florida Artificial Intelligence Research Society Conference2334-07542334-07622022-05-013510.32473/flairs.v35i.13065166850Relating Preference Languages By Their Expressive PowerMichael Andrew Huelsman0Miroslaw Truszczynski1Saint Anselm CollegeUniversity of KentuckyThere has been a great deal of research into methods for representing preferences, called preference representation languages. Often, research in this area deals with a limited number of similar languages, in isolation. This work establishes a new method of analyzing the similarity of different languages by considering the class of preference orders that each language is capable of expressing. Our method involves the definition of a relation called preference representation language subsumption, which allows us to relate various languages by their expressive power. We demonstrate several general proof techniques for showing that such a relation exists or does not exist. Additionally, we provide a small case study for several languages that express preferences over combinatorial domains and discuss several analytical uses for the proposed subsumption relation.https://journals.flvc.org/FLAIRS/article/view/130651preferencespreference reasoingpreference representationcomputational social choice
spellingShingle Michael Andrew Huelsman
Miroslaw Truszczynski
Relating Preference Languages By Their Expressive Power
Proceedings of the International Florida Artificial Intelligence Research Society Conference
preferences
preference reasoing
preference representation
computational social choice
title Relating Preference Languages By Their Expressive Power
title_full Relating Preference Languages By Their Expressive Power
title_fullStr Relating Preference Languages By Their Expressive Power
title_full_unstemmed Relating Preference Languages By Their Expressive Power
title_short Relating Preference Languages By Their Expressive Power
title_sort relating preference languages by their expressive power
topic preferences
preference reasoing
preference representation
computational social choice
url https://journals.flvc.org/FLAIRS/article/view/130651
work_keys_str_mv AT michaelandrewhuelsman relatingpreferencelanguagesbytheirexpressivepower
AT miroslawtruszczynski relatingpreferencelanguagesbytheirexpressivepower