Refining the Semantics of Epistemic Specifications

Answer set programming (ASP) is an efficient problem-solving approach, which has been strongly supported both scientifically and technologically by several solvers, ongoing active research, implementations in many different fields. However, although researchers acknowledged long ago the necessity of epistemic operators language ASP for better introspective reasoning, this research venue did not attract much attention until recently. Moreover, existing extensions literature are widely approved either, due to fact that some propose unintended results even simple acyclic programs, new unexpected may possibly be found, more importantly, have reasonings critical programs. To end, Cabalar et al. recently identified structural properties programs formally support a possible semantics proposal such standardise their results. Nonetheless, soundness these still under debate, they accepted either community. Thus, it seems there time really understand paradigm, mature formalism, determine principles providing formal justification understandable models. In paper, we mainly focus on approaches, criteria satisfactory supposed satisfy, ways improve them. We also extend well-known propositions here-and-there logic (HT) into HT so as reveal real behaviour Finally, slightly novel ASP, can considered reflexive extension al.'s recent formalism called autoepistemic ASP.