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

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

1 2 3 ... 5 6 7 next

  1. Lukasiewicz, Thomas; Malizia, Enrico: Complexity results for preference aggregation over ((m))CP-nets: max and rank voting (2022)
  2. Campigotto, Paolo; Teso, Stefano; Battiti, Roberto; Passerini, Andrea: Learning modulo theories for constructive preference elicitation (2021)
  3. Eiter, Thomas; Kaminski, Tobias: Pruning external minimality checking for answer set programs using semantic dependencies (2021)
  4. Montazery, Mojtaba; Wilson, Nic: Scaling-invariant maximum margin preference learning (2021)
  5. Alanazi, Eisa; Mouhoub, Malek; Zilles, Sandra: The complexity of exact learning of acyclic conditional preference networks from swap examples (2020)
  6. Bjorkman, Beth; Gravelle, Sean; Hodge, Jonathan K.: Cubic preferences and the character admissibility problem (2019)
  7. Cabalar, Pedro; Costantini, Stefania; De Gasperis, Giovanni; Formisano, Andrea: Multi-context systems in dynamic environments (2019)
  8. Levit, Vadim; Komarovsky, Zohar; Grinshpoun, Tal; Bazzan, Ana L. C.; Meisels, Amnon: Incentive-based search for equilibria in Boolean games (2019)
  9. Lukasiewicz, Thomas; Malizia, Enrico: Complexity results for preference aggregation over ((m))CP-nets: Pareto and majority voting (2019)
  10. Skowron, Piotr; Faliszewski, Piotr; Slinko, Arkadii: Axiomatic characterization of committee scoring rules (2019)
  11. Wilson, Nic; Dubois, Didier; Prade, Henri: CP-nets, ( \pi)-pref nets, and Pareto dominance (2019)
  12. Albrecht, Stefano V.; Stone, Peter: Autonomous agents modelling other agents: a comprehensive survey and open problems (2018)
  13. Ben Amor, Nahla; Dubois, Didier; Gouider, Héla; Prade, Henri: Possibilistic preference networks (2018)
  14. Destercke, Sébastien: A generic framework to include belief functions in preference handling and multi-criteria decision (2018)
  15. Faliszewski, Piotr; Skowron, Piotr; Slinko, Arkadii; Talmon, Nimrod: Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (2018)
  16. Ribeiro, Marcos Roberto; Barioni, Maria Camila N.; de Amo, Sandra; Roncancio, Claudia; Labbé, Cyril: Incremental evaluation of continuous preference queries (2018)
  17. Schiendorfer, Alexander; Knapp, Alexander; Anders, Gerrit; Reif, Wolfgang: MiniBrass: soft constraints for MiniZinc (2018)
  18. Ahmed, Sultan; Mouhoub, Malek: Probabilistic TCP-net (2017)
  19. Armengol, Eva; Puyol-Gruart, Josep: A reward-based approach for preference modeling: a case study (2017)
  20. Belahcene, Khaled; Labreuche, Christophe; Maudet, Nicolas; Mousseau, Vincent; Ouerdane, Wassila: Explaining robust additive utility models by sequences of preference swaps (2017)

1 2 3 ... 5 6 7 next