# A survey of advances in epistemic logic program solvers

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Sep 2018.

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

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

## Abstract (arXiv)

Recent research in extensions of Answer Set Programming has included a renewed interest in the language of Epistemic Specifications, which adds modal operators K ("known") and M ("may be true") to provide for more powerful introspective reasoning and enhanced capability, particularly when reasoning with incomplete information. An epistemic logic program is a set of rules in this language. Infused with the research has been the desire for an efficient solver to enable the practical use of such programs for problem solving. In this paper, we report on the current state of development of epistemic logic program solvers.