A survey of advances in epistemic logic program solvers
Not on the map. Why?
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 19 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2024Solving Epistemic Logic Programs using Generate-and-Test with Propagation29 Oct 2024
- 2021Thirty years of Epistemic Specifications17 Aug 2021