On Merging Multiple Versions of A Knowledge Base

摘要

In this paper, we address the problem of merging multiple versions of a knowledge base. We propose a correctness criterion for a merged version. We show that the problem of computing a correct merged version is NP-complete. We then formulate the computation of a correct merged version as an integer programming problem. Semantic information from the domain is used to constrain the set of possible correct merged versions.