scholarly journals The Treewidth of Induced Graphs of Conditional Preference Networks Is Small

Information ◽  
2016 ◽  
Vol 7 (1) ◽  
pp. 5
Author(s):  
Jie Liu ◽  
Jinglei Liu
Keyword(s):  
Conditional Preference ◽  
Conditional Preference Networks

Aggregating Preferences Represented by Conditional Preference Networks

2021 ◽  
pp. 3-18
Author(s):  
Abu Mohammad Hammad Ali ◽  
Howard J. Hamilton ◽  
Elizabeth Rayner ◽  
Boting Yang ◽  
Sandra Zilles
Keyword(s):  
Conditional Preference ◽  
Conditional Preference Networks

scholarly journals Cutting Cycles of Conditional Preference Networks with Feedback Set Approach

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zhaowei Liu ◽  
Ke Li ◽  
Xinxin He
Keyword(s):  
Artificial Intelligence ◽  
Time Complexity ◽  
Research Topic ◽  
Feedback Vertex Set ◽  
Feedback Arc Set ◽  
Qualitative Representation ◽  
Conditional Preference ◽  
Vertex Set ◽  
Feedback Set ◽  
Conditional Preference Networks

As a tool of qualitative representation, conditional preference network (CP-net) has recently become a hot research topic in the field of artificial intelligence. The semantics of CP-nets does not restrict the generation of cycles, but the existence of the cycles would affect the property of CP-nets such as satisfaction and consistency. This paper attempts to use the feedback set problem theory including feedback vertex set (FVS) and feedback arc set (FAS) to cut cycles in CP-nets. Because of great time complexity of the problem in general, this paper defines a class of the parent vertices in a ring CP-nets firstly and then gives corresponding algorithm, respectively, based on FVS and FAS. Finally, the experiment shows that the running time and the expressive ability of the two methods are compared.

Sign in / Sign up

Export Citation Format

Share Document