Decomposition of Distributed Nonmonotonic Multi-Context Systems

摘要: Multi-Context Systems (MCS) are formalisms that enable the inter-linkage of single knowledge bases, called contexts, via bridge rules. Recently, a fully distributed algorithm for evaluating heterogeneous, nonmonotonic MCS was described in [7]. In this paper, we continue line work and present decomposition technique which analyzes topology an MCS. It applies pruning techniques to get economically small representations context dependencies. Orthogonal this, characterize minimal interfaces information exchange between such data transmissions can be minimized. We then novel evaluation operates on query plan is compiled with interface minimization. The effectiveness optimization demonstrated by prototype implementation, uses off-the-shelf SAT solver shows encouraging experimental results.