D. Angluin, Queries and concept learning, Machine Learning, pp.319-342, 1988.
DOI : 10.1007/BF00116828

D. Angluin, Negative results for equivalence queries, Machine Learning, pp.121-150, 1990.
DOI : 10.1007/BF00116034

D. Angluin, M. Frazier, and L. Pitt, Learning conjunctions of Horn clauses, Machine Learning, pp.147-164, 1992.

M. Arias and R. Khardon, Learning Closed Horn Expressions, Information and Computation, vol.178, issue.1, pp.214-240, 2002.
DOI : 10.1016/S0890-5401(02)93162-7

P. Auer and P. M. Long, Structural results about on-line learning models with and without queries, Machine Learning, pp.147-181, 1999.

J. Basilico and T. Hofmann, Unifying collaborative and content-based filtering, Twenty-first international conference on Machine learning , ICML '04, pp.9-17, 2004.
DOI : 10.1145/1015330.1015394

M. Binshtok, R. Brafman, C. Domshlak, and S. Shimony, Generic preferences over subsets of structured objects, Journal of Artificial Intelligence Research, vol.34, pp.133-164, 2009.

C. Boutilier, R. Brafman, H. Hoos, and D. Poole, Reasoning with conditional ceteris paribus preference statements, Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI'99), pp.71-80, 1999.

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole, CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements, Journal of Artificial Intelligence Research, vol.21, pp.135-191, 2004.

R. Brafman and C. Domshlak, Graphically structured value-function compilation, Artificial Intelligence, vol.172, issue.2-3, pp.325-349, 2008.
DOI : 10.1016/j.artint.2007.07.002

R. Brafman and C. Domshlak, Introducing variable importance tradeoffs into CP-nets, Proceedings of the Eighteenth Conference in Uncertainty in Artificial Intelligence (UAI'02), pp.69-76, 2002.

R. Brafman, C. Domshlak, and S. Shimony, On graphical modeling of preference and importance, Journal of Artificial Intelligence Research, vol.25, pp.389-424, 2006.

N. Bshouty, Exact Learning Boolean Functions via the Monotone Theory, Information and Computation, vol.123, issue.1, pp.146-153, 1995.
DOI : 10.1006/inco.1995.1164

N. Bshouty and L. Hellerstein, Attribute-Efficient Learning in Query and Mistake-Bound Models, Journal of Computer and System Sciences, vol.56, issue.3, pp.310-319, 1998.
DOI : 10.1006/jcss.1998.1571

N. Bshouty, S. Goldman, T. Hancock, and S. Matar, Asking Questions to Minimize Errors, Journal of Computer and System Sciences, vol.52, issue.2, pp.268-286, 1996.
DOI : 10.1006/jcss.1996.0021

Y. Dimopoulos, L. Michael, and F. Athienitou, Ceteris paribus preference elicitation with predictive guarantees, Proc. 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pp.1890-1895, 2009.

C. Domshlak and R. Brafman, CP-nets: Reasoning and consistency testing, Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR'02), pp.121-132, 2002.

C. Domshlak, R. Brafman, and S. Shimony, Preference-based configuration of web page content, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pp.1451-1456, 2001.

C. Domshlak, S. Prestwich, F. Rossi, K. B. Venable, and T. Walsh, Hard and soft constraints for reasoning about qualitative conditional preferences, Journal of Heuristics, vol.13, issue.4, pp.4-5263, 2006.
DOI : 10.1007/s10732-006-7071-x

J. Doyle, Y. Shoham, and M. Wellman, A logic of relative desire (preliminary report), Proceedings of the Sixth International Symposium on Methodologies for Intelligent Systems (ISMIS'91), pp.16-31, 1991.

M. Frazier and L. Pitt, CLASSIC learning, Proceedings of the seventh annual conference on Computational learning theory , COLT '94, pp.151-193, 1996.
DOI : 10.1145/180139.174994

J. Goldsmith, J. Lang, M. Truszczynski, and N. Wilson, The computational complexity of dominance and consistency in CP-nets, Journal of Artificial Intelligence Research, vol.33, pp.403-432, 2008.

P. Green and V. Srinivasan, Conjoint Analysis in Consumer Research: Issues and Outlook, Journal of Consumer Research, vol.5, issue.2, pp.103-123, 1978.
DOI : 10.1086/208721

L. Hellerstein and V. Raghavan, Exact learning of DNF formulas using DNF hypotheses, Journal of Computer and System Sciences, vol.70, issue.4, pp.435-470, 2005.
DOI : 10.1016/j.jcss.2004.10.001

R. Khardon, Learning function-free Horn expressions, Machine Learning, pp.241-275, 1999.

J. Lang and J. Mengin, The complexity of learning separable ceteris paribus preferences, Proc. 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pp.848-853, 2009.

N. Littlestone, Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning, pp.285-318, 1988.

W. Maass and G. Turán, Lower bounds methods and separation results for online-learning models, Machine Learning, pp.107-145, 1992.

K. Pillaipakkamnatt and V. Raghavan, On the limits of proper learnability of subclasses of DNF formulas, Machine Learning, pp.237-263, 1996.

F. Rossi, K. Venable, and T. Walsh, mCP nets: Representing and reasoning with preferences of multiple agents, Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp.729-734, 2004.

M. Sachdev, On learning of ceteris paribus preference theories, 2007.

L. Valiant, A theory of the learnable, Communications of the ACM, vol.27, issue.11, pp.1134-1142, 1984.
DOI : 10.1145/1968.1972

N. Wilson, Extending CP-nets with stronger conditional preference statements, Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp.735-741, 2004.

C. Ziegler, G. Lausen, and J. Konstan, On exploiting classification taxonomies in recommender systems, AI Communications, vol.21, issue.2-3, pp.97-125, 2008.