Thirty years of Epistemic Specifications
From MaRDI portal
(Redirected from Thirty years of Epistemic Specifications)
Abstract: 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 emph{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)
Recommendations
Cites work
- \texttt{eclingo}: a solver for epistemic logic programs
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Answer set programming and plan generation
- Autoepistemic answer set programming
- Autoepistemic equilibrium logic and epistemic specifications
- Constructible falsity
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Evaluating epistemic negation in answer set programming
- First-order modal logic
- Founded (auto)epistemic equilibrium logic satisfies epistemic splitting
- Founded world views with autoepistemic equilibrium logic
- scientific article; zbMATH DE number 3865242 (Why is no real title available?)
- scientific article; zbMATH DE number 4158606 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 67493 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1931653 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Logic programming and reasoning with incomplete information
- Logic programs with stable model semantics as a constraint programming paradigm
- New semantics for epistemic specifications
- Nonmonotonic logic and temporal projection
- Notes on \(\eta\)-lattices and constructive logic with strong negation
- On an intuitionistic modal logic
- On modal logic with an intuitionistic base
- On the computational cost of disjunctive logic programming: Propositional case
- On the relation between default and autoepistemic logic
- On uniform equivalence of epistemic logic programs
- Revisiting Epistemic Specifications
- Revisiting explicit negation in answer set programming
- selp: a single-shot epistemic logic program solver
- Semantical considerations on nonmonotonic logic
- Splitting epistemic logic programs
- Splitting epistemic logic programs
- The language of epistemic specifications (refined) including a prototype solver
- What should a database know?
Cited in
(4)
This page was built for publication: Thirty years of Epistemic Specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085582)
