The Computational Complexity of Dominance and Consistency in CP-Nets

15 January 2014

Papers citing "The Computational Complexity of Dominance and Consistency in CP-Nets"

6 / 6 papers shown

Title
Reasoning With Conditional Ceteris Paribus Preference Statem Craig Boutilier Ronen I. Brafman Holger H. Hoos David Poole 73 327 0 23 Jan 2013
Introducing Variable Importance Tradeoffs into CP-Nets Ronen I. Brafman Carmel Domshlak 64 145 0 12 Dec 2012
On Graphical Modeling of Preference and Importance Ronen I. Brafman Carmel Domshlak Solomon Eyal Shimony 80 179 0 28 Sep 2011
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements Craig Boutilier Ronen I. Brafman Carmel Domshlak H. H. Hoos David Poole 154 925 0 30 Jun 2011
Structure and Complexity in Planning with Unary Operators Ronen I. Brafman Carmel Domshlak 61 101 0 26 Jun 2011
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques Carmel Domshlak F. Rossi Kristen Brent Venable T. Walsh 101 102 0 22 May 2009