Talk:Answer set programming

message: Can someone attempt to rewrite this article for benefit of people who aren't already 100% aware of answer set programming is? Relevant examples would be a huge help.  — Preceding unsigned comment added by 38.99.133.121 (talk) 18:56, 3 October 2012 (UTC)
thread_title:  Article is completely opaque for anyone who isn't already an expert 

message: "An answer set program is composed of a set of rules, each rules being composed of an head and a tail: 'head <-- body'"  is that supposed to be "head <-- tail"?
:Actually, it's "body" the correct term; "tail" was my mistake. Changed. - Liberatore(T) 23:03, 12 May 2006 (UTC)
replies: text: V. Lifschitz (2002) disagrees with you: "The negation as failure symbol is allowed to occur in the head of a rule, and not only in the body as in traditional logic programming." (page 41, lines 8-9). If don't have access to that article see . Tizio 17:00, 8 January 2007 (UTC)
replies: text:  Negation as failure in the head may well be permissible in the language discussed in that paper, but that should be considered as an extension -- and not part of the usual syntax for answer set programs Zootalures 17:59, 18 February 2007 (UTC)
thread_title:  tail/body 

message: I've made a go at cleaning up the article a bit, although it's still not perfect. The Math sections which were in the syntax section before looked messy (and IMHO the example rules given were not representative of the "standard" ASP syntax (see for instance  for a good overview of the "basic" syntax and a number of extensions). 
I'd prefer it if the rule sections that i've added were in math blocks using the "formal" syntax (i.e. \neg and  \leftarrowinstead of - and :- , but the latex converter was a bit fickle and it was hard to get a given program to look consistent (parts seemed to be translated to png, and others to HTML, which looked ugly).
It would be nice to see some coverage of disjunction and choice in the head (i.e. dlv head choice and smodels choice rules), also something about variable expansion, and function symbols (and possibly how they are considered in relation to predicates in prolog)
Also there should probably be some context and history relating to Datalog but I'm not well enough versed to provide this.
There should also be a link to or merge with Stable model semantics. 
Zootalures 00:41, 19 February 2007 (UTC)
thread_title:  Start of Clean up 

message: It would be useful to have more information in the article about the computational process. Otherwise, it is hard to be sure that answer set programs are really declarative. The link to the DPLL algorithm does not give enough information about the treatment of negation.136.187.112.90 (talk) 02:22, 25 March 2008 (UTC)
thread_title:  The computational process 

message: This is a naive or stupid question or both: but what exactly is the relationship to QBF?  I noticed, just from hands-on experience writing some ASP programs, that most clauses/sentences that one writes are of the form "there exists" (i.e. if this is true(i.e. exists) then that is true (i.e. exists)), while aggregates tend to have a "for-all" flavor to them. Now, one can't nest these arbitrarily (clasp/clingo spews an error about "unstratified predicates" or something like that), but still, ASP seems to somehow have a there-exists/for-all-like structure, nested to (no more than) one level.  Can this be expressed formally?  Or perhaps in the stable model semantics article?  linas (talk) 04:38, 25 April 2012 (UTC)
thread_title:  Relationship to [[QBF]] ? 

message: Hello fellow Wikipedians,
I have just modified  on Answer set programming. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20080223132705/http://asparagus.cs.uni-potsdam.de:80/contest/ to http://asparagus.cs.uni-potsdam.de/contest/
When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).
Cheers.—InternetArchiveBot (Report bug) 04:42, 15 October 2016 (UTC)
thread_title:  External links modified 

message: I notice the opening to this article and the History section are taken almost verbatim from an unreferenced AAAI 2008 research paper due to Vladimir Lifschitz:
https://www.aaai.org/Papers/AAAI/2008/AAAI08-270.pdf
I suggest a cleanup.  — Preceding unsigned comment added by 49.127.106.93 (talk) 00:55, 20 September 2019 (UTC)
thread_title:  Plagiarism?