Erratum to: Database preference queries - a possibilistic logic approach with symbolic priorities
- 351 Downloads
This note corrects a claim made in the above-mentioned paper about the exact representation of a conditional preference network by means of a possibilistic logic base with partially ordered symbolic weights. We provide a counter-example that shows that the possibilistic logic representation is indeed not always exact. This is the basis of a short discussion on the difficulty of obtaining an exact representation.
- 2.Dubois, D., Kaci, S., Prade, H.: Approximation of conditional preferences networks “CP-nets” in possibilistic logic. In: Proceedings 15th IEEE Inter. Conf. on Fuzzy Systems (FUZZ-IEEE), Vancouver, July 16–21, pp. 2337–2342. IEEE (2006)Google Scholar
- 4.Dubois, D., Prade, H., Touazi, F.: Conditional Preference-nets, possibilistic logic, and the transitivity of priorities. In: Bramer, M., Petridis, M. (eds.) Research and Development in Intelligent Systems XXX, Proc. of AI-2013, the 33rd SGAI International Conf. on Innovative Techniques and Applications of Artificial Intelligence, Cambridge, UK, December 10–12, pp. 175–184 (2013)Google Scholar
- 5.Dubois, D., Prade, H., Touazi, F.: Conditional preference networks and possibilistic logic. In: Proceedings 12th Eur. Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’13), July 7–10, vol. 7958 of LNAI, pp. 181–193. Springer (2013)Google Scholar
- 7.Kaci, S.: Working With Preferences: Less Is More. Springer (2012)Google Scholar
- 8.Kaci, S., Prade, H.: Mastering the processing of preferences by using symbolic priorities. In: 18th European Conference on Artificial Intelligence (ECAI’08), pp. 376–380 (2008)Google Scholar