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

arXiv: https://arxiv.org/abs/1608.06910 · HTML: https://mlsanity.com/paper/1608.06910/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Aug 2016.

## Built on by (most cited first, 3 of 3)

- [Thirty years of Epistemic Specifications](https://mlsanity.com/paper/2108.07669/) (2021)
- [Refining the Semantics of Epistemic Specifications](https://mlsanity.com/paper/2109.08289/) (2021)
- [Solving Epistemic Logic Programs using Generate-and-Test with Propagation](https://mlsanity.com/paper/2410.22130/) (2024)

## Abstract (arXiv)

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.