Answer set programming: Difference between revisions

Revision as of 09:37, 15 February 2021

Revision as of 08:33, 16 February 2021

Line 265:

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-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-354 |date=2018}} </ref> avoid grounding altogether by using a combination of [[resolution]] and [[Coinduction|coinduction.]]