Solving Epistemic Logic Programs using Generate-and-Test with Propagation
This addresses efficiency issues in computational logic for researchers and practitioners, with incremental improvements in solver performance.
The paper tackles the problem of solving epistemic logic programs by introducing a generate-and-test framework with propagation, resulting in a solver that achieves a ~3.3x speed-up and solves 91% more instances on benchmarks.
This paper introduces a general framework for generate-and-test-based solvers for epistemic logic programs that can be instantiated with different generator and tester programs, and we prove sufficient conditions on those programs for the correctness of the solvers built using this framework. It also introduces a new generator program that incorporates the propagation of epistemic consequences and shows that this can exponentially reduce the number of candidates that need to be tested while only incurring a linear overhead. We implement a new solver based on these theoretical findings and experimentally show that it outperforms existing solvers by achieving a ~3.3x speed-up and solving 91% more instances on well-known benchmarks.