Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic
نویسندگان
چکیده
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of conflict and two quantities of agreement are defined. The former is shown to be a generalization of the well-known Dalal distance which is the hamming distance between two interpretations. The latter are, respectively, a quantity of strong agreement which measures the amount of information on which two belief bases “totally” agree, and a quantity of weak agreement which measures the amount of information that is believed by one source but is unknown to the other. All three quantity measures are based on the weighted prime implicant, which represents beliefs in a prioritized belief base. We then define a degree of conflict and two degrees of agreement based on our quantity of conflict and quantities of agreement. We also consider the impact of these measures on belief merging and information source ordering.
منابع مشابه
Measuring conflict and agreement between two prioritized belief bases
In this paper, we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of conflict and two quantities of agreement are defined. The former is shown to be a generalization of the Dalal distance. The latter are, respectively, a quantity of strong agreement which measures the amount of informati...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملA possibilistic handling of partially ordered information
In standard possibilistic logic, prioritized in formation are encoded by means of weighted knowledge bases. This paper proposes an exten sion of possibilistic logic to deal with partially ordered information which can be viewed as a family of possibilistic knowledge bases. We show that all basic notions of possibilis tic logic have natural counterparts when dealing with partially ordered inf...
متن کاملA Model-based Approach for Merging Prioritized Knowledge Bases in Possibilistic Logic
This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propositional logic and the merged result of our approach is a normal possibility distribution. We also give an algorithm to obtain the syntactical counterpart of the semantic approach. The logical properties of our approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fuzzy Sets and Systems
دوره 161 شماره
صفحات -
تاریخ انتشار 2010