Belief Merging Using Normal Forms
Belief merging aims to conciliate multiple possibly inconsistent belief bases into a consistent common belief base. To handle inconsistency some operators have been proposed. Most of them do not consider inconsistent bases. PS-Merge is an alternative method of merging that uses the notion of Partial Satisfiability and allows us to take into account inconsistent bases. PS-Merge needs the bases represented as DNF formulas, nevertheless, many practical problems are easily represented in its CNF. The aim of this paper is to extend the notion of Partial Satisfiability in order to consider bases represented as CNF formulas. Moreover, we consider Prime Normal forms in order to define a method that allows us to implement PS-Merge for difficult theories. We also show that once the belief bases are represented as sets of normal forms, PS-Merge is polynomial.
KeywordsNormal Form Conjunctive Normal Form Belief Base Disjunctive Normal Form Propositional Formula
Unable to display preview. Download preview PDF.
- 1.Borja Macías, V., Pozos Parra, P.: Model-based belief merging without distance measures. In: Proceedings of the Sixth International Conference on Autonomous Agents and Multiagent Systems, Hawai’i, USA, pp. 613–615. IFAAMAS (2007)Google Scholar
- 5.Hue, J., Papini, O., Wurbel, E.: Syntactic propositional belief bases fusion with removed sets. In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty, pp. 66–77 (2007)Google Scholar
- 6.Konieczny, S., Pino-Pérez, R.: On the logic of merging. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) KR 1998: Principles of Knowledge Representation and Reasoning, pp. 488–498. Morgan Kaufmann (1998)Google Scholar
- 10.Lin, J., Mendelzon, A.: Knowledge base merging by majority. In: Pareschi, R., Fronhoefer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Kluwer Academic (1999)Google Scholar
- 11.Marchi, J., Perrussel, L.: Prime normal forms in belief merging. In: FLAIRS Conference (2011)Google Scholar