Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2102.04107 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913204069728256 |
|---|---|
| author | Fargier, Hélène Mengel, Stefan Mengin, Jérôme |
| author_facet | Fargier, Hélène Mengel, Stefan Mengin, Jérôme |
| contents | Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the complexity of some queries (optimization, dominance in particular). We extend in this paper some of these results, and study other queries which have not been addressed so far, like equivalence, and transformations, like conditioning and variable elimination, thereby contributing to a knowledge compilation map for languages based on conditional preference statements. We also study the expressiveness and complexity of queries and transformations for generalized additive utilities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2102_04107 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages Fargier, Hélène Mengel, Stefan Mengin, Jérôme Artificial Intelligence Computational Complexity Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the complexity of some queries (optimization, dominance in particular). We extend in this paper some of these results, and study other queries which have not been addressed so far, like equivalence, and transformations, like conditioning and variable elimination, thereby contributing to a knowledge compilation map for languages based on conditional preference statements. We also study the expressiveness and complexity of queries and transformations for generalized additive utilities. |
| title | An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages |
| topic | Artificial Intelligence Computational Complexity |
| url | https://arxiv.org/abs/2102.04107 |