A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Faster

TL;DR

This paper introduces a new parallel, memory-efficient solver for epistemic logic programs that significantly improves the ability to handle complex problems faster and with less memory than existing solutions.

Contribution

It presents a novel parallel solver for ELPs that reduces memory usage and enhances speed, enabling the solving of more complex problems than previous methods.

Findings

Solver handles more complex ELPs efficiently.

Memory usage grows linearly with problem size.

Solver outperforms existing ELP solvers in speed.

Abstract

As the practical use of answer set programming (ASP) has grown with the development of efficient solvers, we expect a growing interest in extensions of ASP as their semantics stabilize and solvers supporting them mature. Epistemic Specifications, which adds modal operators K and M to the language of ASP, is one such extension. We call a program in this language an epistemic logic program (ELP). Solvers have thus far been practical for only the simplest ELPs due to exponential growth of the search space. We describe a solver that is able to solve harder problems better (e.g., without exponentially-growing memory needs w.r.t. K and M occurrences) and faster than any other known ELP solver.