Answer set programming: Difference between revisions

Content deleted Content added
mNo edit summary
m History: Wikilinked
Line 15:
{{cite book |first1=V. |last1=Marek |first2=M. |last2=Truszczyński |chapter=Stable models and an alternative logic programming paradigm |editor-first=Krzysztof R. |editor-last=Apt |title=The Logic programming paradigm: a 25-year perspective |url=https://books.google.com/books?id=GIhQAAAAMAAJ |year=1999 |publisher=Springer |isbn=978-3-540-65463-6 |format=PDF |pages=169–181 |ref={{harvid|Apt|1999}}|arxiv=cs/9809032 }}</ref>
and in [Niemelä 1999].<ref>{{cite journal |first=I. |last=Niemelä |title=Logic programs with stable model semantics as a constraint programming paradigm |journal=Annals of Mathematics and Artificial Intelligence |volume=25 |issue=3/4 |pages=241–273 |year=1999 |doi=10.1023/A:1018930122475 |url=http://users.ics.aalto.fi/ini/papers/lp-csp-long.ps.gz |format=Postscript,gzipped}}</ref>
Indeed, the new terminology of "answer set" instead of "stable model" was first proposed by [[Vladimir Lifschitz|Lifschitz]]<ref>{{cite journal |first=V. |last=Lifschitz |title=Action Languages, Answer Sets, and Planning |year=1999}} In {{harvnb|Apt|1999|pp=357–374}}</ref> in a paper appearing in the same retrospective volume as the Marek-Truszczynski paper.
 
==Answer set programming language AnsProlog==