We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasis lies on an extensible design that allows for an easy incorporation of new language features in an efficient system environment. 1 Motivation, Features, and System Architecture A major advantage of Answer Set Programming (ASP; [1]) is its rich modeling language. Paired with high-performance solver technology, it has made ASP a popular tool for declarative problem solving. As a consequence, all ASP solvers rely on sophisticated preprocessing techniques for dealing with the rich input language. The primary purpose of preprocessing is to accomplish an effective variable substitution in the input program. This is why these preprocessors are often referred to as grounders. Although there is meanwhile quite a variety of ASP solvers, there are merely two major grounders, namely...