Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Propositional knowledge base revision and minimal change
Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Artificial Intelligence - Special issue on nonmonotonic reasoning
The strategy-proofness landscape of merging
Journal of Artificial Intelligence Research
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measured as a number resulting from the aggregation of the distances to each base of the profile. In this work we define a new familly of propositional merging operators, close to such distance-based merging operators, but relying on a set-theoretic definition of closeness, already at work in several revision/update operators from the literature. We study a specific merging operator of this family, obtained by considering set-product as the aggregation function.