On the Existence of Answer Sets in Normal Extended Logic Programs
Martin W. A. Caminada, Chiaki Sakama · ORCA Online Research @Cardiff (Cardiff University) · 2006
Abstract. One of the serious problems in answer set programming is that relatively small pieces of information can cause a total absence of answer sets. To cope with this problem, this paper introduces a class of normal extended logic programs which are extended logic programs, whose defeasible rules are comparable to normal defaults in default logic. Under suitable program transformations, we show that every normal extended logic program always yields at least one answer set. 1