Models of Clark’s Completion for Some Classes of Logic Programs
Stefano Baratella · Fundamenta Informaticae · 1991
Aim of this paper is to provide an alternative proof of consistency for the completion of a semi-strict program. Furthermore, we prove the continuity of the immediate consequence map associated to a locally call-consistent program with respect to any preinterpretation that is a model of the equality theory of its Clark’s completion.