Open AccessGrounding and Solving in Answer Set Programming
Author(s) -
Kaufmann Benjamin,
Leone Nicola,
Perri Simona,
Schaub Torsten
Publication year - 2016
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v37i3.2672
Subject(s) - answer set programming , ground , set (abstract data type) , computer science , key (lock) , propositional calculus , theoretical computer science , focus (optics) , logic programming , object (grammar) , artificial intelligence , programming language , engineering , physics , computer security , optics , electrical engineering
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.