Epistemic negation not along with default negation¬ plays a key role in knowledge
representation and nonmonotonic reasoning. However, the existing epistemic approaches …

Defined by Gelfond in 1991, epistemic specifications constitute an extension of Answer Set
Programming (ASP) that introduces subjective literals. A subjective literal allows checking …

The language of epistemic specifications and epistemic logic programs extends disjunctive
logic programs under the stable model semantics with modal constructs called subjective …

Epistemic logic programs constitute an extension of the stable model semantics to deal with
new constructs called subjective literals. Informally speaking, a subjective literal allows …

Abstract Answer Set Programming is widely applied research area for knowledge
representation and for solving industrial domains. One of the challenges of this formalism …

Answer Set Programming (ASP) is a prominent problem-modeling and solving framework,
whose solutions are called answer sets. Epistemic logic programs (ELP) extend ASP to …

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics
built upon the Answer Set Programming system clingo. The input language of eclingo uses …

An epistemic logic program is a set of rules written in the language of Epistemic
Specifications, an extension of the language of answer set programming that provides for …

Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set
Programming (ASP) providing means for reasoning over answer sets within the language …

This paper presents a novel algorithm for computing world views of different semantics of
epistemic logic programs (ELP) and two of its realization, called EP-ASP (for an older …