Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics
Authors: Matthias Thimm
IJCAI 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We now report on a small feasibility study that analyses the average approximation ratio of the algorithms from above on existing data sets. We implemented the algorithms from Sections 6.1 6.4 in Java, building on existing implementations for AAFs in Tweety Project9. We also implemented algorithms OPT and OPT* that optimally solve the problems MAXSTABLE and MAXSTABLE*, respectively. |
| Researcher Affiliation | Academia | Matthias Thimm Artificial Intelligence Group, University of Hagen, Germany matthias.thimm@fernuni-hagen.de |
| Pseudocode | Yes | Algorithm 1 GCF algorithm for MAXSTABLE. Algorithm 2 SCF algorithm for MAXSTABLE. Algorithm 3 GFR algorithm for MAXSTABLE*. Algorithm 4 SFR algorithm for MAXSTABLE*. |
| Open Source Code | Yes | We implemented8 the algorithms from Sections 6.1 6.4 in Java, building on existing implementations for AAFs in Tweety Project9. 8http://tweetyproject.org/r/?r=ijcai24_opt_mt |
| Open Datasets | Yes | We used the ICCMA17 and the ICCMA19 datasets as benchmarks.11 ... 11http://argumentationcompetition.org |
| Dataset Splits | No | The paper mentions using 'ICCMA17 and the ICCMA19 datasets as benchmarks' but does not provide specific details on how these datasets were split into training, validation, or test sets. |
| Hardware Specification | Yes | The experiments were conducted on a server with Intel Xeon E5-2643 v3 3.40-GHz CPUs (each algorithm is single-threaded) with 192GB RAM |
| Software Dependencies | Yes | We implemented8 the algorithms from Sections 6.1 6.4 in Java, building on existing implementations for AAFs in Tweety Project9. We also implemented algorithms OPT and OPT* that optimally solve the problems MAXSTABLE and MAXSTABLE*, respectively. The algorithms for OPT and OPT* rely on straightforward Max SAT encodings of MAXSTABLE and MAXSTABLE* and were implemented in Java as well, using the Max SAT solver open-wbo 2.110 as backend solver. |
| Experiment Setup | Yes | The experiments were conducted on a server with Intel Xeon E5-2643 v3 3.40-GHz CPUs (each algorithm is single-threaded) with 192GB RAM and we set a timeout of 10 minutes per instance. |