. Pref, Set(preferences) For the preferences, we are going to have one item for each criterion

<. Transparent, ?. , and ?. Hffs-?, There is a dependency between the machine and the color' > means that selecting 'Transparent' implies also selecting 'HFFS', for Expert 1, because of the reason mentioned, Argument: String For example

L. Amgoud and S. Vesic, A new approach for preference-based argumentation frameworks, Annals of Mathematics and Artificial Intelligence, vol.28, issue.10???15, pp.149-183, 2011.
DOI : 10.1007/s10472-011-9271-9

M. Bienvenu, J. Lang, and N. Wilson, From preference logics to preference languages, and back, KR, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00624483

M. Caminada and L. Amgoud, An axiomatic account of formal argumentation, AAAI, pp.608-613, 2005.

M. Croitoru, J. Fortin, and N. Oren, Arguing with preferences in ecobiocap, Proceedings of the 4th International Conference on Computational Models of Argument, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00763656

P. M. Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artificial Intelligence, vol.77, issue.2, pp.321-357, 1995.
DOI : 10.1016/0004-3702(94)00041-X

S. Hansson, What is ceteris paribus preference?, Journal of Philosophical Logic, vol.25, issue.3, pp.307-332, 1996.
DOI : 10.1007/BF00248152

D. B. Johnson, Finding All the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.4, issue.1, pp.77-84, 1975.
DOI : 10.1137/0204007

S. Kaci and L. Van-der-torre, Preference-based argumentation: Arguments supporting multiple values, International Journal of Approximate Reasoning, vol.48, issue.3, pp.730-751, 2008.
DOI : 10.1016/j.ijar.2007.07.005
URL : https://hal.archives-ouvertes.fr/hal-00800647

S. Modgil, Reasoning about preferences in argumentation frameworks, Artificial Intelligence, vol.173, issue.9-10, pp.901-934, 2009.
DOI : 10.1016/j.artint.2009.02.001

H. Prakken and S. Modgil, Clarifying some misconceptions on the aspic+ framework . Computational Models of Argument, Proceedings of COMMA 2012, 2012.

H. Prakken, An abstract framework for argumentation with structured arguments, Argument & Computation, vol.4, issue.2, pp.93-124, 2011.
DOI : 10.1016/S0004-3702(96)00041-0

. Robert-endre-tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

J. Van-benthem, P. Girard, and O. Roy, Everything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences, Journal of Philosophical Logic, vol.100, issue.1, pp.83-125, 2009.
DOI : 10.1007/s10992-008-9085-3

A. W. Gerard and . Vreeswijk, An algorithm to compute minimally grounded and admissible defence sets in argument systems, Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006, pp.109-120, 2006.