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 121 articles , 1 standard article )

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

1 2 3 ... 5 6 7 next

  1. Albrecht, Stefano V.; Stone, Peter: Autonomous agents modelling other agents: a comprehensive survey and open problems (2018)
  2. Destercke, Sébastien: A generic framework to include belief functions in preference handling and multi-criteria decision (2018)
  3. Armengol, Eva; Puyol-Gruart, Josep: A reward-based approach for preference modeling: a case study (2017)
  4. Belahcene, Khaled; Labreuche, Christophe; Maudet, Nicolas; Mousseau, Vincent; Ouerdane, Wassila: Explaining robust additive utility models by sequences of preference swaps (2017)
  5. Endriss, Ulle; Grandi, Umberto: Graph aggregation (2017)
  6. Jabbour, Said; Sais, Lakhdar; Salhi, Yakoub: Mining top-$k$ motifs with a SAT-based framework (2017)
  7. Lukasiewicz, Thomas; Malizia, Enrico: A novel characterization of the complexity class $\Theta_k^\mathrmP$ based on counting and comparison (2017)
  8. Obiedkov, Sergei: Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics (2017)
  9. Xu, Hong; Satish Kumar, T. K.; Koenig, Sven: The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (2017)
  10. Couceiro, M.; Dubois, D.; Prade, H.; Waldhauser, T.: Decision-making with Sugeno integrals. Bridging the gap between multicriteria evaluation and decision under uncertainty (2016)
  11. Dorn, Britta; Krüger, Dominikus: On the hardness of bribery variants in voting with CP-nets (2016)
  12. Eichhorn, Christian; Fey, Matthias; Kern-Isberner, Gabriele: CP- and OCF-networks -- a comparison (2016)
  13. Xu, Hong; Kumar, T. K. Satish; Koenig, Sven: A new solver for the minimum weighted vertex cover problem (2016)
  14. Žabkar, Jure; Bratko, Ivan; Demšar, Janez: Extracting qualitative relations from categorical data (2016)
  15. Bulteau, Laurent; Chen, Jiehua; Faliszewski, Piotr; Niedermeier, Rolf; Talmon, Nimrod: Combinatorial voter control in elections (2015)
  16. Cadilhac, Anaïs; Asher, Nicholas; Lascarides, Alex; Benamara, Farah: Preference change (2015)
  17. Dorn, Britta; Krüger, Dominikus; Scharpfenecker, Patrick: Often harder than in the constructive case: destructive bribery in CP-nets (2015)
  18. Dubois, Didier; Hadjali, Allel; Prade, Henri; Touazi, Fayçal: Erratum to: “Database preference queries -- a possibilistic logic approach with symbolic priorities” (2015)
  19. Eiter, Thomas; Strass, Hannes; Truszczyński, Mirosław; Woltran, Stefan: A glimpse on Gerhard Brewka’s contributions to artificial intelligence (2015)
  20. Liu, Jinglei; Liao, Shizhong: Expressive efficiency of two kinds of specific CP-nets (2015)

1 2 3 ... 5 6 7 next