Implementing semantic merging operators using binary decision diagrams

There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of information by a set of formulae and then use a merging operator to produce a set of formulae as output. A valuable range of model-based operators have been proposed that conform to interesting and intuitive properties. However, the implementation of such operators has remained unaddressed, partly due to the considerable computational complexity of the proposals. To address this, we propose a methodology for implementing model-based merging operators using the notion of dilation and a type of data structure called a binary decision diagram. We apply this method by implementing four merging operators from the literature and experimentally evaluating their average-case performance. The results indicate that while the complexity is indeed significant, problems of modest size can be treated using commodity hardware and short computation times.

Access to full text restricted pending copyright check.