Ontological CP−Nets
Representing and reasoning about preferences is a key issue in many real-world scenarios in which personalized access to information is required. Many approaches have been proposed and studied in the literature that allow a system to work with qualitative or quantitative preferences; among the quali...
| Main Authors: | , , , , |
|---|---|
| Format: | Book section |
| Published: |
2014
|
| _version_ | 1797072920369954816 |
|---|---|
| author | Di Noia, T Lukasiewicz, T Martinez, M Simari, G Tifrea−Marciuska, O |
| author_facet | Di Noia, T Lukasiewicz, T Martinez, M Simari, G Tifrea−Marciuska, O |
| author_sort | Di Noia, T |
| collection | OXFORD |
| description | Representing and reasoning about preferences is a key issue in many real-world scenarios in which personalized access to information is required. Many approaches have been proposed and studied in the literature that allow a system to work with qualitative or quantitative preferences; among the qualitative models, one of the most prominent are CP-nets. Their clear graphical structure unifies an easy representation of user preferences with good computational properties when computing the best outcome. In this paper, we show how to reason with CP-nets when the attributes modeling the knowledge domain are structured via an underlying domain ontology. We show how the computation of all undominated feasible outcomes of an ontological CP-net can be reduced to the solution of a constraint satisfaction problem, and study the computational complexity of the basic reasoning problems in ontological CP-nets. |
| first_indexed | 2024-03-06T23:14:37Z |
| format | Book section |
| id | oxford-uuid:66b22dd0-fbb0-482e-b898-1798c3798ad3 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:14:37Z |
| publishDate | 2014 |
| record_format | dspace |
| spelling | oxford-uuid:66b22dd0-fbb0-482e-b898-1798c3798ad32022-03-26T18:33:30ZOntological CP−NetsBook sectionhttp://purl.org/coar/resource_type/c_3248uuid:66b22dd0-fbb0-482e-b898-1798c3798ad3Department of Computer Science2014Di Noia, TLukasiewicz, TMartinez, MSimari, GTifrea−Marciuska, ORepresenting and reasoning about preferences is a key issue in many real-world scenarios in which personalized access to information is required. Many approaches have been proposed and studied in the literature that allow a system to work with qualitative or quantitative preferences; among the qualitative models, one of the most prominent are CP-nets. Their clear graphical structure unifies an easy representation of user preferences with good computational properties when computing the best outcome. In this paper, we show how to reason with CP-nets when the attributes modeling the knowledge domain are structured via an underlying domain ontology. We show how the computation of all undominated feasible outcomes of an ontological CP-net can be reduced to the solution of a constraint satisfaction problem, and study the computational complexity of the basic reasoning problems in ontological CP-nets. |
| spellingShingle | Di Noia, T Lukasiewicz, T Martinez, M Simari, G Tifrea−Marciuska, O Ontological CP−Nets |
| title | Ontological CP−Nets |
| title_full | Ontological CP−Nets |
| title_fullStr | Ontological CP−Nets |
| title_full_unstemmed | Ontological CP−Nets |
| title_short | Ontological CP−Nets |
| title_sort | ontological cp nets |
| work_keys_str_mv | AT dinoiat ontologicalcpnets AT lukasiewiczt ontologicalcpnets AT martinezm ontologicalcpnets AT simarig ontologicalcpnets AT tifreamarciuskao ontologicalcpnets |