DA2 merging operators

https://doi.org/10.1016/j.artint.2004.04.008Get rights and content
Under an Elsevier user license
open archive

Abstract

A new framework for propositional merging is presented. DA2 merging operators, parameterized by a distance between interpretations and two aggregation functions, are introduced. Many distances and aggregation functions can be used and many merging operators already defined in the literature (including both model-based ones and syntax-based ones) can be encoded as specific DA2 operators. Both logical and complexity properties of those operators are studied. An important result is that (under very weak assumptions) query entailment from merged bases is “only” at the first level of the polynomial hierarchy when any of the DA2 operators is used. As a by-product, complexity results for several existing merging operators are derived as well.

Keywords

Knowledge representation
Belief merging
Computational complexity

Cited by (0)

This paper is an extended and revised version of the paper entitled “Distance-based merging: a general framework and some complexity results”, that appeared in the Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR'02), Toulouse, 2002, pp. 97–108.