Jump to content

Talk:Answer set programming

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 129.6.33.46 (talk) at 14:34, 1 September 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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. Is there a reference that includes it?

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