Distributed Evaluation of Nonmonotonic Multi-context Systems
Authors: Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner
JAIR 2015 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We address this shortcoming and present a suite of such algorithms which includes a basic algorithm DMCS, an advanced version DMCSOPT that exploits topology-based optimizations, and a streaming algorithm DMCS-STREAMING that computes equilibria in packages of bounded size. The algorithms behave quite differently in several respects, as experienced in thorough experimental evaluation of a system prototype. From the experimental results, we derive a guideline for choosing the appropriate algorithm and running mode in particular situations, determined by the parameter settings. |
| Researcher Affiliation | Academia | Minh Dao-Tran EMAIL Thomas Eiter EMAIL Michael Fink EMAIL Thomas Krennwallner EMAIL Institute f ur Informationssysteme, TU Wien Favoritenstrasse 9-11, A-1040 Vienna, Austria |
| Pseudocode | Yes | Algorithm 1: DMCS(V, hist) at Ck = (Lk, kbk, brk) Input: V: relevant interface, hist: visited contexts Data: c(k): static cache Output: set of accumulated partial belief states |
| Open Source Code | Yes | The algorithms have been implemented in a prototype system that is available as open source.8 |
| Open Datasets | No | We have implemented the algorithms in a system prototype. To assess the effects of the optimization techniques, we have set up a benchmarking system and conducted comprehensive experiments with MCSs of various topologies and interlinking. |
| Dataset Splits | No | Each parameter setting has been tested on five instances. For each instance, we measured the total running time and the total number of returned partial equilibria on DMCS, DMCSOPT in non-streaming and streaming mode. |
| Hardware Specification | Yes | We conducted the experiments on a host system using 4-core Intel(R) Xeon(R) CPU 3.0GHz processor with 16GB RAM, running Ubuntu Linux 12.04.1. |
| Software Dependencies | Yes | Furthermore, we used DLV [build BEN/Sep 28 2011 gcc 4.3.3] as a back-end ASP solver. |
| Experiment Setup | Yes | The other quantitative parameters are represented as tuple P = (n, s, b, r), where n is the system size (number of contexts), s is the local theory size (number of ground atoms in a local theory), b is the number of local atoms that can be used as bridge atoms in other contexts, in other words, the number of interface atoms, and r is the maximal number of bridge rules. The generator generates a bridge rule while iterating from 1 to r with 50% chance; hence on average r/2 bridge rules are generated. We allow bridge bodies of size 1 or 2. |