Answer Set Programming (ASP) is a logic programming language widely used in non-monotonic automated reasoning. Thanks to its popularity, in the last years there has been a great interest towards the developing of efficient solvers, required to deal with complex problems, like planning and NP problem-solving. These solvers can be unable to deal with programs that are “grounded” on huge amount of data, possibly resident in different sites. To address this problem, in this paper we present a distributed approach to ASP problems, which involves all the phases of the overall solving process: from a distributed grounder (which can also be used as a solver for stratified programs) to two different techniques to deal with the pure solving phase (for non-stratified program too), both of them using the non-standard graph coloring algorithm to characterize answer sets. We show three proposals for solving the issue, two of them developed with the high-level framework Apache Spark, while the third one is a C++ direct implementation of the first one.