Revisiting Epistemic Specifications
From MaRDI portal
Abstract: In 1991, Michael Gelfond introduced the language of epistemic specifications. The goal was to develop tools for modeling problems that require some form of meta-reasoning, that is, reasoning over multiple possible worlds. Despite their relevance to knowledge representation, epistemic specifications have received relatively little attention so far. In this paper, we revisit the formalism of epistemic specification. We offer a new definition of the formalism, propose several semantics (one of which, under syntactic restrictions we assume, turns out to be equivalent to the original semantics by Gelfond), derive some complexity results and, finally, show the effectiveness of the formalism for modeling problems requiring meta-reasoning considered recently by Faber and Woltran. All these results show that epistemic specifications deserve much more attention that has been afforded to them so far.
Recommendations
- New semantics for epistemic specifications
- Thirty years of Epistemic Specifications
- The language of epistemic specifications (refined) including a prototype solver
- Autoepistemic equilibrium logic and epistemic specifications
- Rethinking epistemic logic with belief bases
- scientific article; zbMATH DE number 4181308
- scientific article; zbMATH DE number 589737
Cited in
(22)- Autoepistemic answer set programming
- Determining inference semantics for disjunctive logic programs
- Autoepistemic equilibrium logic and epistemic specifications
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Epistemic logic programs: a study of some properties
- Evaluating epistemic negation in answer set programming
- New semantics for epistemic specifications
- The language of epistemic specifications (refined) including a prototype solver
- Logic programming with graded modality
- Characterizing and extending answer set semantics using possibility theory
- selp: a single-shot epistemic logic program solver
- Splitting epistemic logic programs
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- Determining action reversibility in STRIPS using answer set and epistemic logic programming
- Epistemic logic programs: a different world view
- Founded (auto)epistemic equilibrium logic satisfies epistemic splitting
- About epistemic negation and world views in epistemic logic programs
- On uniform equivalence of epistemic logic programs
- \texttt{eclingo}: a solver for epistemic logic programs
- Thirty years of Epistemic Specifications
- Epistemic logic programs: a study of some properties
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
This page was built for publication: Revisiting Epistemic Specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001928)
