CAJ | 학술논문

CP-nets是表达定性偏好的图模型，从偏好知识的推理角度看，其上的一个典型的推理任务是CP-nets所表达的偏好是否一致，即CP-nets是否蕴含着矛盾知识。目前无环CP-nets上的一致性已经得到解决，即任何无环CP-nets表达的是一致性知识，并可实现知识的单调推理，但是带环CP-nets的一致性却不确定。本文不仅完成了带环CP-nets上的一致性检测该开问题的形式化描述，还给出了其可能解决的一个方法，即从图的反馈顶点集和反馈边集的角度来实现一致性的检测。
CP-nets시표체정성편호적도모형，종편호지식적추리각도간，기상적일개전형적추리임무시CP-nets소표체적편호시부일치，즉CP-nets시부온함착모순지식。목전무배CP-nets상적일치성이경득도해결，즉임하무배CP-nets표체적시일치성지식，병가실현지식적단조추리，단시대배CP-nets적일치성각불학정。본문불부완성료대배CP-nets상적일치성검측해개문제적형식화묘술，환급출료기가능해결적일개방법，즉종도적반궤정점집화반궤변집적각도래실현일치성적검측。
CP-nets (conditional preference networks) are a graphical model for representing qualitative preference knowledge. From the perspective of knowledge reasoning, a central task is that whether the preference relations represented by CP-nets are consistent with the preference statements. That is, whether CP-nets imply contradiction knowledge. By now, consistency of acyclic CP-nets has been solved, while the consistency of cyclic CP-nets is far from being settled, and still being an open problem. In this paper, a formal preference open problem about the consistency of cyclic CP-nets is introduced, and a possible solution to this problem is investigated in detail. Namely, we may solve this problem by decomposition techniques of feedback vertex set or feedback arc set.