Content deleted Content added
m →Dependency parsing: nom -> abl makes the 2 nodes different |
Compulogger (talk | contribs) query-driven systems |
||
Line 263:
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.
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>, avoid grounding altogether by using a combination of [[resolution]] and [[Coinduction|coinduction]].
{| class="wikitable"
|-
| |||