Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916932851073024 |
|---|---|
| author | Sauerwald, Kai Skiba, Kenneth Fermé, Eduardo Meyer, Thomas |
| author_facet | Sauerwald, Kai Skiba, Kenneth Fermé, Eduardo Meyer, Thomas |
| contents | We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings, constructing a choice function via a relation on the alternatives is not always possible. However, we show that one can always construct a choice function via a linear order on sets of alternatives, even when a fallback value is encoded as the minimal element in the linear order. The axiomatics of such choice functions are presented for the general case and the case of union-closed input restrictions. Restricted choice structures have applications in knowledge representation and reasoning, and here we discuss their applications for theory change and abstract argumentation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03315 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback Sauerwald, Kai Skiba, Kenneth Fermé, Eduardo Meyer, Thomas Artificial Intelligence Logic in Computer Science 03E99, 91B14 I.2.4 We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings, constructing a choice function via a relation on the alternatives is not always possible. However, we show that one can always construct a choice function via a linear order on sets of alternatives, even when a fallback value is encoded as the minimal element in the linear order. The axiomatics of such choice functions are presented for the general case and the case of union-closed input restrictions. Restricted choice structures have applications in knowledge representation and reasoning, and here we discuss their applications for theory change and abstract argumentation. |
| title | Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback |
| topic | Artificial Intelligence Logic in Computer Science 03E99, 91B14 I.2.4 |
| url | https://arxiv.org/abs/2506.03315 |