Thirty years of Epistemic Specifications
Not on the map. Why?
Abstract (arXiv)
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective literals. Using subjective literals, it is possible to check whether a regular literal is true in every or some stable models of the program, those models, in this context also called belief sets, being collected in a set called world view. This allows for representing, within the language, whether some proposition should be understood accordingly to the open or the closed world assumption. Several attempts for capturing the intuitions underlying the language by means of a formal semantics were given, resulting in a multitude of proposals that makes it difficult to understand the current state of the art. In this paper, we provide an overview of the inception of the field and the knowledge representation and reasoning tasks it is suitable for. We also provide a detailed analysis of properties of proposed semantics, and an outlook of challenges to be tackled by future research in the area. Under consideration in Theory and Practice of Logic Programming (TPLP)
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 12 of its 67 references that are in the map. First posted on arXiv 17 Aug 2021.
Builds on
12 of 67 references.
References · 12
- 2020selp: A Single-Shot Epistemic Logic Program Solvercited by 7
- 2020eclingo: A solver for Epistemic Logic Programscited by 7
- 2020Structural Decompositions of Epistemic Logic Programscited by 5
- 2018Splitting Epistemic Logic Programscited by 4
- 2016A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Fastercited by 3
- 2019Founded World Views with Autoepistemic Equilibrium Logiccited by 3
- 2018A survey of advances in epistemic logic program solverscited by 2
- 2019Revisiting Explicit Negation in Answer Set Programmingcited by 2
- 2014ESmodels: An Epistemic Specification Solvercited by 1
- 2018Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)cited by 1
- 2019Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splittingcited by 1
- 2019On Uniform Equivalence of Epistemic Logic Programscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2023Epistemic Logic Programs: a study of some propertiescited by 1
- 2025Epistemic Logic Programs: Non-Ground and Counting Complexitycited by 1
- 2024Solving Epistemic Logic Programs using Generate-and-Test with Propagationcited by 0
- 2025Counterfactual Explanations as Planscited by 0
- 2025Counterfactual Explanations as Plans13 Feb 2025
- 2025Epistemic Logic Programs: Non-Ground and Counting Complexity31 Jan 2025
- 2024Solving Epistemic Logic Programs using Generate-and-Test with Propagation29 Oct 2024
- 2023Epistemic Logic Programs: a study of some properties28 Sep 2023