MASP-Reduce: A Proposal for Distributed Computation of Stable Models

Authors Federico Igne, Agostino Dovier, Enrico Pontelli

Thumbnail PDF


  • Filesize: 264 kB
  • 4 pages

Document Identifiers

Author Details

Federico Igne
  • University of Udine, Udine, Italy and New Mexico State University, NM, USA
Agostino Dovier
  • University of Udine, Udine, Italy
Enrico Pontelli
  • New Mexico State University, NM, USA

Cite AsGet BibTex

Federico Igne, Agostino Dovier, and Enrico Pontelli. MASP-Reduce: A Proposal for Distributed Computation of Stable Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


There has been an increasing interest in recent years towards the development of efficient solvers for Answer Set Programming (ASP) and towards the application of ASP to solve increasing more challenging problems. In particular, several recent efforts have explored the issue of scalability of ASP solvers when addressing the challenges caused by the need to ground the program before resolution. This paper offers an alternative solution to this challenge, focused on the use of distributed programming techniques to reason about ASP programs whose grounding would be prohibitive for mainstream ASP solvers. The work builds on a proposal of a characterization of answer set solving as a form of non-standard graph coloring. The paper expands this characterization to include syntactic extensions used in modern ASP (e.g., choice rules, weight constraints). We present an implementation of the solver using a distributed programming framework specifically designed to manipulate very large graphs, as provided by Apache Spark, which in turn builds on the MapReduce programming framework. Finally, we provide a few preliminary results obtained from the first prototype implementation of this approach.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Logic programming and answer set programming
  • Software and its engineering → Massively parallel systems
  • ASP solving
  • Parallelism
  • Map-reduce


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. C. Anger, M. Gebser, T. Linke, A. Neumann, and T. Schaub. The NoMoRe++ System. In Chitta Baral, Gianluigi Greco, Nicola Leone, and Giorgio Terracina, editors, Logic Programming and Nonmonotonic Reasoning, 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings, volume 3662 of LNCS, pages 422-426. Springer, 2005. Google Scholar
  2. Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, and Torsten Schaub. Clingcon: The next generation. TPLP, 17(4):408-461, 2017. URL:
  3. A. Dal Palù, A. Dovier, E. Pontelli, and G. Rossi. GASP: Answer set programming with lazy grounding. Fundam. Inform., 96(3):297-322, 2009. Google Scholar
  4. J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters, volume 51, pages 107-113. ACM, January 2008. Google Scholar
  5. Agostino Dovier, Andrea Formisano, and Enrico Pontelli. An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems. J. Exp. Theor. Artif. Intell., 21(2):79-121, 2009. URL:
  6. Agostino Dovier, Andrea Formisano, and Enrico Pontelli. Perspectives on Logic-Based Approaches for Reasoning about Actions and Change. In Marcello Balduccini and Tran Cao Son, editors, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, volume 6565 of Lecture Notes in Computer Science, pages 259-279. Springer, 2011. Google Scholar
  7. École Polytechnique Fédérale. Scala - Object-Oriented Meets Functional (website), 2018. [last accessed Feb. 2018] URL:
  8. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Clingo = ASP + Control: Preliminary Report. CoRR, abs/1405.3694, 2014. URL:
  9. K. Konczak, T. Linke, and T. Schaub. Graphs and Colorings for Answer Set Programming: Abridged Report. In Vladimir Lifschitz and Ilkka Niemelä, editors, Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings, volume 2923 of Lecture Notes in Computer Science, pages 127-140. Springer, 2004. Google Scholar
  10. Kathrin Konczak, Thomas Linke, and Torsten Schaub. Graphs and colorings for answer set programming. TPLP, 6(1-2):61-106, 2006. URL:
  11. Claire Lefèvre, Christopher Béatrix, Igor Stéphan, and Laurent Garcia. ASPeRiX, a first-order forward chaining approach for answer set computing. TPLP, 17(3):266-310, 2017. Google Scholar
  12. Martin Odersky, Lex Spoon, and Bill Venners. Programming in Scala: Updated for Scala 2.12. Artima Incorporation, USA, 3rd edition, 2016. Google Scholar
  13. T. Son and E. Pontelli. Planning for biochemical pathways: A case study of answer set planning in large planning problem instances. In Marina De Vos and Torsten Schaub, editors, Proceedings of the First International SEA'07 Workshop, Tempe, Arizona, USA, volume 281 of CEUR Workshop Proceedings, pages 116-130, January 2007. Google Scholar
  14. The Apache Software Foundation. Apache Hadoop, Spark, and Graphx (websites), 2018. [last accessed Feb. 2018],, URL: