Query Answering in Propositional Circumscription
Authors: Mario Alviano
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | A prototypical implementation is tested on instances from the 2nd International Competition on Computational Models of Argumentation. |
| Researcher Affiliation | Academia | Mario Alviano University of Calabria alviano@mat.unical.it |
| Pseudocode | Yes | Algorithm 1: Anwer Query(Γ, O, q); Algorithm 2: Anwer Query(Γ, O {q}, q); Algorithm 3: Anwer Query(Γ, O {q}, q); Algorithm 4: Incomplete Anwer Query(Γ, O, q) |
| Open Source Code | No | The paper mentions that Algorithm 1 has been implemented in the solver CIRCUMSCRIPTINO [Alviano, 2017b] and used by PYGLAF, which are existing, cited tools. It does not provide a new open-source release or a link to specific code for the algorithms presented in this paper. |
| Open Datasets | Yes | The experiment comprises instances from ICCMA 17 related to credulous (DC) and skeptical (DS) acceptance problems for preferred (PR) and semi-stable (SST) semantics... [Gaggl et al., 2016] |
| Dataset Splits | No | The paper states 'Each benchmark comprises 350 testcases' but does not specify how these instances were split into training, validation, or test sets for their experiments. No explicit validation split information is provided. |
| Hardware Specification | Yes | was run on an Intel Xeon 2.4 GHz with 16 GB of memory, and time and memory were limited to 10 minutes and 15 GB, respectively. |
| Software Dependencies | Yes | Model searches (i.e., function solve) are performed by means of the SAT solver GLUCOSE 4.1 [Audemard and Simon, 2009], with its default configuration. |
| Experiment Setup | Yes | The experiment... was run on an Intel Xeon 2.4 GHz with 16 GB of memory, and time and memory were limited to 10 minutes and 15 GB, respectively. |