Completion of Disjunctive Logic Programs

Authors: Mario Alviano, Carmine Dodaro

IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental 5 Experiment The impact of the new techniques proposed in this paper was assessed empirically on three benchmarks: (i) instances from ASP Competitions containing choice rules easily replaceable by unbounded disjunctions; (ii) instances of Minimal Hitting Set downloaded from http://research.nii.ac.jp/~uno/ dualization.html; (iii) single rule p(X) : X = 1..n. i.e., the symbolic version of program {W x2[1..n] p(xi) } for increasing values of constant n 1. The experiment was run on an Intel Xeon CPU 2.4 GHz with 16 GB of RAM. Time and memory were limited to 600 seconds and 15 GB. The tested solvers are WASP, CLASP 3.1.3 [Gebser et al., 2015b], and GLUCOSE 4.0 [Audemard and Simon, 2009].
Researcher Affiliation Academia Mario Alviano and Carmine Dodaro Department of Mathematics and Computer Science, University of Calabria, Italy {alviano, dodaro}@mat.unical.it
Pseudocode No The paper does not contain structured pseudocode or algorithm blocks.
Open Source Code No The paper states that the completion has been implemented in WASP, an open-source solver, but does not provide specific access information (e.g., a repository link or a clear statement of code release) for the methodology described in this paper.
Open Datasets Yes instances of Minimal Hitting Set downloaded from http://research.nii.ac.jp/~uno/ dualization.html
Dataset Splits No The paper uses benchmark instances but does not provide specific details on training, validation, or test dataset splits needed for reproduction.
Hardware Specification Yes The experiment was run on an Intel Xeon CPU 2.4 GHz with 16 GB of RAM.
Software Dependencies Yes The tested solvers are WASP, CLASP 3.1.3 [Gebser et al., 2015b], and GLUCOSE 4.0 [Audemard and Simon, 2009].
Experiment Setup Yes Time and memory were limited to 600 seconds and 15 GB.