Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
From Non-Convex Aggregates to Monotone Aggregates in ASP
Authors: Mario Alviano, Wolfgang Faber, Martin Gebser
IJCAI 2016 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | an experiment reported in [Alviano, 2015] shows that it can pave the way to new applications of ASP. In fact, among 46 tested instances of Generalized Subset Sum, 38 were solved by GRINGO+CLASP within a timeout of 900 seconds, while the SMT solver Z3 could only solve 14 of these instances. |
| Researcher Affiliation | Academia | Mario Alviano University of Calabria, Italy EMAIL Wolfgang Faber University of Huddersfield, UK EMAIL Martin Gebser University of Potsdam, Germany EMAIL |
| Pseudocode | No | No structured pseudocode or algorithm blocks were found in the paper. |
| Open Source Code | No | While the paper states that 'The translation function is now part of the recent version 4.5 of the grounder GRINGO', it does not provide a direct link to its own source code or explicitly state that the code for the methodology described in this paper is publicly available. |
| Open Datasets | No | The paper mentions '46 tested instances of Generalized Subset Sum' but does not provide concrete access information (e.g., a link or citation) for these instances. |
| Dataset Splits | No | The paper does not provide specific dataset split information (e.g., train/validation/test percentages or counts) for reproducibility. |
| Hardware Specification | No | The paper does not provide specific hardware details (e.g., CPU/GPU models, memory) used for running the experiments. |
| Software Dependencies | Yes | The translation function is now part of the recent version 4.5 of the grounder GRINGO. |
| Experiment Setup | Yes | In fact, among 46 tested instances of Generalized Subset Sum, 38 were solved by GRINGO+CLASP within a timeout of 900 seconds, while the SMT solver Z3 could only solve 14 of these instances. |