Name
Abstract | ||
|---|---|---|
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 this line of work and present a decomposition technique for MCS which analyzes the topology of an MCS. It applies pruning techniques to get economically small representations of context dependencies. Orthogonal to this, we characterize minimal interfaces for information exchange between contexts, such that data transmissions can be minimized. We then present a novel evaluation algorithm that operates on a query plan which is compiled with topology pruning and interface minimization. The effectiveness of the optimization techniques is demonstrated by a prototype implementation, which uses an off-the-shelf SAT solver and shows encouraging experimental results. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-15675-5_5 | JELIA |
Keywords | Field | DocType |
nonmonotonic mcs,nonmonotonic multi-context system,bridge rule,novel evaluation algorithm,topology pruning,pruning technique,context dependency,decomposition technique,multi-context systems,data transmission,knowledge base,distributed algorithm,sat solver,context dependent,information exchange | Biconnected component,Computer science,Boolean satisfiability problem,Information exchange,Theoretical computer science,Distributed algorithm,Minification,Rotation formalisms in three dimensions,Query plan,Distributed computing | Conference |
Volume | ISSN | ISBN |
6341 | 0302-9743 | 3-642-15674-6 |
Citations | PageRank | References |
10 | 0.64 | 15 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seif El-Din Bairakdar | 1 | 23 | 1.21 |
| Minh Dao-Tran | 2 | 395 | 20.39 |
| Thomas Eiter | 3 | 7238 | 532.10 |
| Michael Fink | 4 | 1145 | 62.43 |
| Thomas Krennwallner | 5 | 468 | 29.14 |