1. What have the authors contributed in "Disjunctive programs with set constraints" ?
The authors 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.. The authors introduce new class of models called selector stable models which represent all models which can be computed by an analogue the Gelfond-Lifschitz transform.. The authors 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 the authors show that there is a natural proof theory associated with selector stable models.
read more
2. What are the future works mentioned in the paper "Disjunctive programs with set constraints" ?
Moreover, their work opens up several topics for further research.. Thus it should be interesting to study analogues of the notions of equivalence of normal logic programs and its variations such as those in [ 8 ] for SCD programs.. Finally, it is possible to extend their approach to programs which allow arbitrary set constraints in the bodies and to predicate logic versions of SCD programs.. Their work also suggests that a natural notion of equivalence of two SCD programs is that they have the same set of selector stable models.
read more