Strongly Equivalent Epistemic Answer Set Programs

Abstract

Epistemic answer set programming ($\mathsf {EASP}$) is a recent epistemic extension of answer set programming ($\mathsf {ASP}$), endowed with the epistemic answer set (EAS) semantics. EASs propose a straightforward generalisation of ASP’s original answer set semantics. Moreover, they provide intended results both for cyclic and acyclic programs, possibly containing arbitrary constraints. Epistemic here-and-there logic ($\mathsf {EHT}$) is also a recent epistemic extension of a well-known nonclassical logic called here-and-there logic ($\mathsf {HT}$), which is intermediate between classical logic and intuitionistic logic. In this paper, we discuss a strong equivalence characterisation for $\mathsf {EASP}$ programs, which is identified on $\mathsf {EHT}$.