CP-nets (Condition Preference Nets) is a tool for representing and reasoning with condition ceteris paribus preference statements put forward by Craig Boutilier, but how to represent and realize is not given. In this paper, after some notions and an example of CP-nets, we mainly introduce the realization for the class of binary-valued, tree-structured CP-nets, which is conducted on the basis of chain CP-nets. So we explain how to divide a tree-structured CP-net into chain CP-nets, how to represent and realize the chain CP-nets, and how to merge these sub-rankings derived from the chain CP-nets to generate the preference ranking of the tree-structured CP-net. At last, the corresponding analysis is carried out to prove its correctness.

References in zbMATH (referenced in 101 articles , 1 standard article )

Showing results 1 to 20 of 101.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Dorn, Britta; Krüger, Dominikus: On the hardness of bribery variants in voting with CP-nets (2016)
  2. Bulteau, Laurent; Chen, Jiehua; Faliszewski, Piotr; Niedermeier, Rolf; Talmon, Nimrod: Combinatorial voter control in elections (2015)
  3. Cadilhac, Anaïs; Asher, Nicholas; Lascarides, Alex; Benamara, Farah: Preference change (2015)
  4. Dubois, Didier; Hadjali, Allel; Prade, Henri; Touazi, Fayçal: Erratum to: “Database preference queries -- a possibilistic logic approach with symbolic priorities” (2015)
  5. Miranda, Enrique; Destercke, Sébastien: Extreme points of the credal sets generated by comparative probabilities (2015)
  6. Kaci, Souhila; Patel, Namrata: A postulate-based analysis of comparative preference statements (2014)
  7. Marques-Silva, Joao; Previti, Alessandro: On computing preferred muses and mcses (2014)
  8. Hüllermeier, Eyke (ed.); Fürnkranz, Johannes (ed.): Editorial: Preference learning and ranking (2013)
  9. Mattei, Nicholas; Pini, Maria Silvia; Rossi, Francesca; Venable, K.Brent: Bribery in voting with CP-nets (2013)
  10. Tzitzikas, Yannis; Papadakos, Panagiotis: Interactive exploration of multi-dimensional and hierarchical information spaces with real-time preference elicitation (2013)
  11. Confalonieri, Roberto; Nieves, Juan Carlos; Osorio, Mauricio; Vázquez-Salceda, Javier: Dealing with explicit preferences and uncertainty in answer set programming (2012)
  12. Koriche, Frédéric: Relational networks of conditional preferences (2012)
  13. Maratea, Marco: Planning as satisfiability with IPC simple preferences and action costs (2012)
  14. Nguyen, Tuan Anh; Do, Minh; Gerevini, Alfonso Emilio; Serina, Ivan; Srivastava, Biplav; Kambhampati, Subbarao: Generating diverse plans to handle unknown and partially known user preferences (2012)
  15. Ågotnes, Thomas; van Ditmarsch, Hans: What will they say? -- Public announcement games (2011)
  16. Bienvenu, Meghyn; Fritz, Christian; Mcilraith, Sheila A.: Specifying and computing preferred plans (2011)
  17. Brafman, Ronen I.: Relational preference rules for control (2011)
  18. Brewka, Gerhard; Eiter, Thomas; Fink, Michael: Nonmonotonic multi-context systems: a flexible approach for integrating heterogeneous knowledge sources (2011)
  19. Caragiannis, Ioannis; Procaccia, Ariel D.: Voting almost maximizes social welfare despite limited communication (2011)
  20. Confalonieri, Roberto; Nieves, Juan Carlos: Nested preferences in answer set programming (2011)

1 2 3 4 5 6 next