5 citations found. Retrieving documents...
C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A Tool for Representing and Reasoning about Conditional Ceteris Paribus Preference Statements. submitted for publication, 2002.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Reasoning about Soft Constraints and Conditional.. - Domshlak, Rossi.. (2003)   (4 citations)  Self-citation (Domshlak)   (Correct)

No context found.

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A Tool for Representing and Reasoning about Conditional Ceteris Paribus Preference Statements. submitted for publication, 2002.


Reasoning about Soft Constraints and Conditional.. - Domshlak, Rossi.. (2003)   (4 citations)  Self-citation (Domshlak)   (Correct)

No context found.

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A Tool for Representing and Reasoning about Conditional Ceteris Paribus Preference Statements. submitted for publication, 2002.


Qualitative Decision Making in Adaptive Presentation of .. - Brafman, Domshlak.. (2003)   Self-citation (Brafman Domshlak)   (Correct)

No context found.

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A tool for representing and reasoning about conditional ceteris paribus preference statements. Journal of Arti cial Intelligence Research, 2003. to appear.


Reasoning about Soft Constraints and Conditional.. - Domshlak, Rossi.. (2003)   (4 citations)  Self-citation (Domshlak)   (Correct)

No context found.

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A Tool for Representing and Reasoning about Conditional Ceteris Paribus Preference Statements. submitted for publication, 2002.


Reasoning About Soft Constraints and Conditional.. - And Approximation..   Self-citation (Domshlak)   (Correct)

....elicitation in such a framework is intuitive, independent of the problem con straints, and suitable for naive users. However, the Achilles heel of CP nets and other sophisticated qualitative preference models [Lang, 2002] is the complexity of reasoning with them [Domshlak and Brafman, 2002; Boutilier et al. 2002] Motivated by a product configuration application [Sabin and Weigel, 1998] we have developed a framework to reason simultaneously about qualitative conditional preference statements and hard and soft constraints. In product configuration, the producer has hard (e.g. component compatibility) ....

....node Xi has Pa(Xi) as its immediate prede cessors. Given this structural information, the user is asked to explicitly specify her preference over the values of Xi for each complete assignment on Pa(Xi) and this preference is assumed to take the form of total [Boutilier et al. 1999] or partial [Boutilier et al. 2002] order over D(X) These conditional preferences over the values of Xi are annotated with the node Xi in the CP net. For example, consider a CPnet with the graph given in Figure 1, and with the preference statements as follows: a , b , a A b) V ( A ) c , a A ) V ( A b) c, c: d , ....

[Article contains additional citation context not shown here]

C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A Tool for Representing and Reasoning about Conditional Ceteris Paribus Preference Statements. submitted for publication, 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC