Talk:Answer set programming

Just wanted to check that the first step in reduct is actually intended:

 1. remove all literals of the head that are negated using negation-as-failure and are in the set; 

It isn't in the definition of stable models in http://citeseer.ist.psu.edu/marek99stable.html (referenced in http://arxiv.org/abs/cs.AI/0003033 from the wiki), or in http://citeseer.ist.psu.edu/gelfond93representing.html (referenced in http://www.cs.utexas.edu/users/vl/papers/asppg.ps from the wiki). It isn't in Baral's survey either, http://citeseer.ist.psu.edu/baral94logic.html.

I gather it must be for disjunctive logic programs, but can't find a reference applying the stable approach to disjunctive prgrams (if so, the wiki page should clarify that the literals in the head are disjoined). A failure negation in the head would be mean the rule is concluding that the system cannot infer a fact. Perhaps this is related to autoepistemic reasoning? Any clarification appreciated.

--Conrad 2005 Sep 01