Revisiting Epistemic Specifications

• Published in: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning pp. 315 - 333
• Main Author: Truszczyński, Mirosław
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011
• Series: Lecture Notes in Computer Science
• Subjects: Hamiltonian Cycle; Logic Program; Logic Programming; Modal Atom; Stable Model
• ISBN: 3642208312; 9783642208317
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-20832-4_20

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.