Disjunctive Programs with Set Constraints [chapter]

Victor W. Marek, Jeffrey B. Remmel
2012 Lecture Notes in Computer Science  
To Vladimir Lifschitz on the occasion of his 65-th birthday: in recognition of his many contributions to Nonmonotonic Reasoning which have inspired so many researchers in the field. Abstract. We study an extension of disjunctive logic programs called set constraint disjunctive (SCD ) programs where the clauses of the program are allowed to have a disjunction of monotone set constraints in their head and arbitrary monotone and antimonotone set constraints in their body. We introduce new class of
more » ... models called selector stable models which represent all models which can be computed by an analogue the Gelfond-Lifschitz transform. We show that the stable models of disjunctive logic programs can be defined in terms of selector stable models and then extend this result to SCD logic programs. Finally we show that there is a natural proof theory associated with selector stable models. ⋆
doi:10.1007/978-3-642-30743-0_32 fatcat:mk7ng3yjsrhejfzf7qbdhnpexa