Grounding and Solving in Answer Set Programming
Benjamin Kaufmann, Nicola Leone, Simona Perri, Torsten H. Schaub · AI Magazine · 2016
Answer set programming is a declarative problem‐solving paradigm that rests upon a work flow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in an effective way, and solving, or how to compute the answer sets, of a propositional logic program obtained by grounding.