Author:
BenAmor Nahla,Dubois Didier,Gouider Héla,Prade Henri
Publisher
Springer International Publishing
Reference16 articles.
1. Ben Amor, N., Benferhat, S.: Graphoid properties of qualitative possibilistic independence relations. Int. J. of Uncertainty, Fuzziness and Knowledge-based Sys. 13(1), 59–96 (2005)
2. Ben Amor, N., Benferhat, S., Mellouli, K.: Anytime propagation algorithm for min-based possibilistic graphs. Soft Computing 8(2), 150–161 (2003)
3. Benferhat, S., Dubois, D., Garcia, L., Prade, H.: On the transformation between possibilistic logic bases and possibilistic causal networks. Int. J. of Approximate Reasoning 29(2), 135–173 (2002)
4. Bienvenu, M., Lang, J., Wilson, N.: From preference logics to preference languages, and back. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proc. KR 2010, Toronto (2010)
5. Brafman, R.I., Domshlak, C.: Introducing variable importance tradeoffs into CP-nets. In: Darwiche, A., Friedman, N. (eds.) Proc.UAI 2002, Alberta, pp. 69–76 (2002)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献