Eclingo
- We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generallyWe describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.…
Author details: | Pedro CabalarORCiDGND, Jorge FandiñoORCiD, Javier Garea, Javier RomeroORCiD, Torsten SchaubORCiDGND |
---|---|
DOI: | https://doi.org/10.1017/S1471068420000228 |
ISSN: | 1471-0684 |
ISSN: | 1475-3081 |
Title of parent work (English): | Theory and practice of logic programming |
Subtitle (English): | a solver for epistemic logic programs |
Publisher: | Cambridge Univ. Press |
Place of publishing: | New York |
Publication type: | Article |
Language: | English |
Date of first publication: | 2020/09/22 |
Publication year: | 2020 |
Release date: | 2023/03/27 |
Tag: | Answer Set Programming; Conformant Planning; Epistemic Logic Programs; Non-Monotonic; Reasoning |
Volume: | 20 |
Issue: | 6 |
Article number: | PII S1471068420000228 |
Number of pages: | 14 |
First page: | 834 |
Last Page: | 847 |
Funding institution: | MINECO, Spain [TIC2017-84453-P]; Alexander von Humboldt Foundation,; GermanyAlexander von Humboldt Foundation; CITIC, Research Center of the; Galician University System - Consellera de Educacion, Universidade e; Formacion Profesional (Xunta de Galicia)Xunta de Galicia; ERDFEuropean; Commission [ED431G 2019/01] |
Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science |
DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke |
Peer review: | Referiert |