TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandinno, Jorge
A1  - Garea, Javier
A1  - Romero, Javier
A1  - Schaub, Torsten H.
T1  - Eclingo
BT  - a solver for epistemic logic programs
JF  - Theory and practice of logic programming
N2  - 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 generally outperforms their obtained results.
KW  - Answer Set Programming
KW  - Epistemic Logic Programs
KW  - Non-Monotonic
KW  - Reasoning
KW  - Conformant Planning
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000228
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 6
SP  - 834
EP  - 847
PB  - Cambridge Univ. Press
CY  - New York
ER  -