On Computing World Views of Epistemic Logic Programs
Authors: Tran Cao Son, Tiep Le, Patrick Kahl, Anthony Leclerc
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | The paper includes an experimental analysis of the performance of the two solvers comparing against a recently developed solver. It also contains an analysis of their performance in goal directed computing against a logic programming based conformant planning system, DLV-K. and 4 Implementation and Evaluation We implement the algorithms described in Section 3 in a prototype called EP-ASP and evaluate (i) the capabilities of EPASP in computing world views of an ELP against ELPsolve using the benchmarks provided in [Kahl et al., 2016]; and (ii) the effectiveness of directed reasoning of EP-ASP, e.g., in computing world views satisfying a given goal by comparing against DLV-K [Eiter et al., 2003], a logic program based system for conformant planning, using the well-known bomb in the toilet problem [Reichgelt, 1987] and its variations. We also implemented a version of EP-ASP that computes the semantics of ELPs given in [Shen and Eiter, 2016] and denote it with EP-ASPse. |
| Researcher Affiliation | Collaboration | Tran Cao Son and Tiep Le Department of Computer Science New Mexico State University Las Cruces, NM 88003, USA Patrick Kahl and Anthony Leclerc SPAWAR Atlantic North Charleston, SC 29410, USA |
| Pseudocode | Yes | Algorithm 1 TESTK1M0(ASP(Π), S) % Can Π have a world view containing S? and Algorithm 2 TESTK0M1(ASP(Π), S) % Can Π have a world view containing S? and Algorithm 3 EP-ASP(Π, k): Compute k world views of Π |
| Open Source Code | Yes | Its code is omitted for space reason and is downloadable from https://github.com/ tiep/EP-ASP. |
| Open Datasets | Yes | We implement the algorithms described in Section 3 in a prototype called EP-ASP and evaluate (i) the capabilities of EPASP in computing world views of an ELP against ELPsolve using the benchmarks provided in [Kahl et al., 2016]; and (ii) the effectiveness of directed reasoning of EP-ASP, e.g., in computing world views satisfying a given goal by comparing against DLV-K [Eiter et al., 2003], a logic program based system for conformant planning, using the well-known bomb in the toilet problem [Reichgelt, 1987] and its variations. and The benchmarks in [Kahl et al., 2016] contain two problems, the Scholarship Eligibility Problems [Gelfond, 1991] (represented by E-XX) and Yale Shooting Problems [Hanks and Mc Dermott, 1987] (represented by Y-XX). ... The ELP encodings of these problems come with the ELPsolve s system. |
| Dataset Splits | No | The paper discusses the use of benchmark problems (E-XX, Y-XX, bomb in the toilet) but does not provide specific train/validation/test dataset split percentages or counts. |
| Hardware Specification | Yes | All experiments are performed on an Intel Core i7 2.8GHz machine with 16GB memory. |
| Software Dependencies | No | The implementation is in Python and uses CLINGO, but no specific version numbers for Python, CLINGO, or any other libraries are provided. It mentions DLV-K but without a version. |
| Experiment Setup | Yes | We note that for Y-XX problems, the planning option is turned on for EP-ASP(se). The length of the solution computed by EP-ASP(se) is given between the parentheses in the column EP-ASP(se). In this experiment, we use EP-ASP(se) with the heuristic described in Subsection 3.3. Without the heuristic, EPASP(se) performs significantly slower and does not scale up well. |