Answer set programming: Difference between revisions

Revision as of 14:44, 28 November 2021

Revision as of 15:07, 28 November 2021

Line 261:

The [https://potassco.org/ Potassco] project acts as an umbrella for many of the systems below, including ''clasp'', grounding systems (''gringo''), incremental systems (''iclingo''), constraint solvers (''clingcon''), [[action language]] to ASP compilers (''coala''), distributed MPI implementations (''claspar''), and many others.

Most systems support variables, but only indirectly, by forcing grounding, by using a grounding system such as ''Lparse'' or ''gringo'' as a front end. The need for grounding can cause a combinatorial explosion of clauses; thus, systems that perform on-the-fly grounding might have an advantage.<ref>{{Cite journal|last=Lefèvre|first=Claire|last2=Béatrix|first2=Christopher|last3=Stéphan|first3=Igor|last4=Garcia|first4=Laurent|date=May 2017-05|title=ASPeRiX, a first-order forward chaining approach for answer set computing*|url=https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abs/asperix-a-firstorder-forward-chaining-approach-for-answer-set-computing/2318F5D6647DF24A8F9A452F4C7B4D49|journal=Theory and Practice of Logic Programming|language=en|volume=17|issue=3|pages=266–310|doi=10.1017/S1471068416000569|issn=1471-0684}}</ref>

Query-driven implementations of answer set programming, such as the Galliwasp system,<ref>

{{cite book |first1=Kyle. |last1=Marple |first2=Gopal. |last2=Gupta |chapter=Galliwasp: A Goal-Directed Answer Set Solver |editor-first=Elvira|editor-last=Albert |title=Logic-Based Program Synthesis and Transformation, 22nd International Symposium, LOPSTR 2012, Leuven, Belgium, September 18-20, 2012, Revised Selected Papers |year=2012 |publisher=Springer |pages=122-136122–136}} </ref>

s(ASP)<ref>{{cite journal |first1=K.|last1=Marple |first2=E. |last2=Salazar |first3=G. |last3=Gupta |title=Computing Stable Models of Normal Logic Programs Without Grounding |journal=CoRR|volume=abs/1709.00501 |date=2017}} [http://arxiv.org/abs/1709.00501]</ref> and s(CASP)<ref>{{cite journal |first1=J. |last1=Arias |first2=M. |last2=Carro |first3=E. |last3=Salazar |first4=K. |last4=Marple |first5=G. |last5=Gupta |title=Constraint Answer Set Programming without Grounding |journal=Theory and Practice of Logic Programming |volume=18 |issue=3-4 |pages=337-354337–354 |date=2018}} </ref> avoid grounding altogether by using a combination of [[resolution (logic)|resolution]] and [[coinduction]].

{| class="wikitable"