Relating Preference Languages By Their Expressive Power

Michael Huelsman, Miroslaw Truszczynski

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
JournalProceedings of the International Florida Artificial Intelligence Research Society Conference, FLAIRS
Volume35
DOIs
StatePublished - 2022
Event35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022 - Jensen Beach, United States
Duration: May 15 2022May 18 2022

Bibliographical note

Publisher Copyright:
© 2021 by the authors. All rights reserved.

Keywords

  • Computational Social Choice
  • Preference Reasoing
  • Preference Representation
  • Preferences

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software

Cite this