TY - JOUR AU - Kaufmann, Benjamin AU - Leone, Nicola AU - Perri, Simona AU - Schaub, Torsten PY - 2016/10/07 Y2 - 2024/03/29 TI - Grounding and Solving in Answer Set Programming JF - AI Magazine JA - AIMag VL - 37 IS - 3 SE - Articles DO - 10.1609/aimag.v37i3.2672 UR - https://ojs.aaai.org/aimagazine/index.php/aimagazine/article/view/2672 SP - 25-32 AB - Answer set programming is a declarative problem solving paradigm that rests upon a workflow 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 a effective way, and solving, or how to compute the answer sets of a propositional logic program obtained by grounding. ER -