Abstract
Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and deal-ing with uncertainty. They often result in a possibilistic knowledge base which is a set of weighted formulas. Although possibilistic logic is inconsistency tolerant, it suffers from the well-known "drowning effect". Therefore, we may still want to obtain a consistent possibilistic knowledge base as the result of merging. In such a case, we argue that it is not always necessary to keep weighted information after merging. In this paper, we define a merging operator that maps a set of possibilistic knowledge bases and a formula representing the integrity constraints to a classical knowledge base by using lexicographic ordering. We show that it satisfies nine postulates that generalize basic postulates for propositional merging given in [11]. These postulates capture the principle of minimal change in some sense. We then provide an algorithm for generating the resulting knowledge base of our merging operator. Finally, we discuss the compatibility of our merging operator with propositional merging and establish the advantage of our merging operator over existing semantic merging operators in the propositional case.
Original language | English |
---|---|
Title of host publication | Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) |
Publisher | AUAI Press |
Pages | 275-281 |
Number of pages | 7 |
ISBN (Print) | 9780974903965 |
Publication status | Published - Jul 2010 |
Event | The 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) - Catalina Island, California, United States Duration: 08 Jul 2010 → 11 Jul 2010 |
Conference
Conference | The 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) |
---|---|
Country | United States |
City | California |
Period | 08/07/2010 → 11/07/2010 |
Bibliographical note
Medium of Output: Conference proceedings, AAAI pressASJC Scopus subject areas
- Artificial Intelligence
- Applied Mathematics