GidL: A grounder for FO+
Johan Wittocx, Maarten Mariën, Marc Denecker · Lirias · 2008
In this paper, we present GIDL, a grounder for FO+. FO+ is a very expressive extension of first-order logic with sev-eral constructs such as inductive definitions, aggregates and arithmetic. We describe the input and output language of GIDL, and provide details about its architecture. In partic-ular, the core grounding algorithm implemented in GIDL is presented. We compare GIDL with other FO+ grounders and with grounders for Answer Set Programming.