Relevance for SAT(ID)
Authors: Joachim Jansen, Bart Bogaerts, Jo Devriendt, Gerda Janssens, Marc Denecker
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | In order to empirically evaluate our proposed approach, we adjusted the IDP3 system [De Cat et al., 2016] and its underlying solver MINISAT(ID) [De Cat et al., 2013] to take relevance into account. |
| Researcher Affiliation | Academia | F KU Leuven, Leuven, Belgium, firstname.lastname@kuleuven.be Aalto University, Espoo, Finland, bart.bogaerts@aalto.fi |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | Yes | The complete set of experiments and information on how to run them can be found at https://dtai.cs.kuleuven.be/static/krr/ files/experiments/idp relevance experiments.tar.gz . |
| Open Datasets | Yes | For these experiments we selected problems from previous ASP competitions that could be encoded without the use of aggregates and functions, since we do not yet support these language constructs. |
| Dataset Splits | No | The paper refers to problems from ASP competitions and a crafted example, but does not specify details on train/validation/test splits, sample counts, or cross-validation setup for these datasets. |
| Hardware Specification | Yes | We ran these problems on an Intel(R) Xeon(R) CPU E5645 @ 2.40GHz CPU, using a time limit of 7200 seconds and a memory limit of 8Gi B. |
| Software Dependencies | No | The paper mentions adjusting 'the IDP3 system [De Cat et al., 2016] and its underlying solver MINISAT(ID) [De Cat et al., 2013]' but does not provide specific version numbers for these software components. |
| Experiment Setup | Yes | For these experiments we selected problems from previous ASP competitions... We ran these problems on an Intel(R) Xeon(R) CPU E5645 @ 2.40GHz CPU, using a time limit of 7200 seconds and a memory limit of 8Gi B. To answer (Q1) we ran all the above problems and their instances with a solver configuration that uses the VSIDS heuristic |