1. Alanazi, E., Mouhoub, M., Zilles, S.: The complexity of learning acyclic CP-nets. In: Subbarao Kambhampati, editor, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), page 1361–1367. IJCAI/AAAI Press (2016)
2. Alanazi, E., Mouhoub, M., Zilles, S.: The complexity of exact learning of acyclic conditional preference networks from swap examples. Artififical Intelligence. 278 (2020)
3. Allen, T.E., Siler, C., Goldsmith, J.: Learning tree-structured CP-nets with local search. In: Vasile Rus and Zdravko Markov, editors, Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2017), pages 8–13. AAAI Press (2017)
4. Bacchus, F., Grove, A.J.: Graphical models for preference and utility. In: Philippe Besnard and Steve Hanks, editors, UAI, pages 3–10. Morgan Kaufmann (1995)
5. Besnard, P., Lang, J., Marquis, P.: Variable forgetting in preference relations over combinatorial domains. In: Brewka et al. [16], page 763–764 (2023)