Program Correspondence Under the Answer-Set Semantics: The Non-Ground Case

The study of various notions of equivalence between logic programs in the area of Answer-Set Programming (ASP) gained increasing interest in recent years. The main reason for this undertaking is that ordinary equivalence between answer-set programs fails to yield a replacement property similar to the one of classical logic. Although many refined program correspondence notions have been introduced in the ASP literature so far, most of these notions were studied for propositional programs only, which limit their practical usability as concrete programming applications require the use of variables. In this paper, the authors address this issue and introduce a general framework for specifying parameterised notions of program equivalence for non-ground disjunctive logic programs under the answer-set semantics.