Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Information Fusion in Logic: A Brief Overview
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Merging with Integrity Constraints
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Logic-based approaches to information fusion
Information Fusion
Merging first-order knowledge using dilation operators
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Duality between merging operators and social contraction operators
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We extend the results of Konieczny and Pino Perez (Journal of Logic and Computation, 2002) concerning merging operators in a finite logical framework to the infinite case (countably many propositional variables). The number of sources we consider remains finite. The main result is the representation theorem. In order to prove it, we state some results which are interesting for their own sake. Some postulates had to be restated in a new form. The new form is equivalent to the old one only in the finite case, but more appropriate to deal with the infinite case. The construction of merging operators starting from distances between valuations is also generalized. Indeed, we introduce a new kind of operators built upon the so-called Cantor distance.