1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in ak-tree. J. Algebr. Discret. Methods 8(2), 277–284 (1987)
2. Amor, N.B., Benferhat, S.: Graphoid properties of qualitative possibilistic independence relations. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 13(1), 59–96 (2005)
3. Lecture Notes in Computer Science;NB Amor,2015
4. Boutilier, C., Bacchus, F., Brafman, R.I.: UCP-networks: a directed graphical representation of conditional utilities. In: Proceedings of UAI, pp. 56–64. Morgan Kaufmann Publishers Inc. (2001)
5. Boutilier, C., Brafman, R. I., Hoos, H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: Proceedings of UAI, pp. 71–80 (1999)