Disjunctive Signed Logic Programs
Mohamed A. Khamsi, Driss Misane · Fundamenta Informaticae · 1997
In this work, we define signed disjunctive programs and investigate the existence of answer sets for this class of programs. Our main argument is based on an analogue of Tarski's fixed point theorem which we prove for multivalued mappings. This is an original approach compared to known techniques used to prove the existence of answer sets for disjunctive programs.