This document provides an introduction to the Answer Set Programming (ASP) tools gringo, clasp, clingo, and iclingo, developed at the University of Potsdam. The first tool, gringo, is a grounder capable of translating logic programs provided by users into equivalent propositional logic programs. The answer sets of such programs can be computed by clasp, which is a solver. The third tool, clingo, integrates the functionalities of gringo and clasp, thus, acting as a monolithic solver for user programs. Finally, iclingo extends clingo by an incremental mode that incorporates both grounding and solving. For one, this document aims at enabling ASP novices to make use of the aforementioned tools. For another, it provides a reference of their features that ASP adepts might be tempted to exploit.

References in zbMATH (referenced in 53 articles )

Showing results 1 to 20 of 53.
Sorted by year (citations)

1 2 3 next

  1. Harrison, Amelia; Lifschitz, Vladimir; Raju, Dhananjay: Program completion in the input language of GRINGO (2017)
  2. Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Redl, Christoph: Domain expansion for ASP-programs with external sources (2016)
  3. Gebser, Martin; Janhunen, Tomi; Kaminski, Roland; Schaub, Torsten; Tasharrofi, Shahab: Writing declarative specifications for clauses (2016)
  4. Eppe, Manfred; Bhatt, Mehul: Approximate postdictive reasoning with answer set programming (2015)
  5. Falkner, Andreas; Ryabokon, Anna; Schenner, Gottfried; Shchekotykhin, Kostyantyn: OOASP: connecting object-oriented and logic programming (2015)
  6. Fichte, Johannes Klaus; Szeider, Stefan: Backdoors to tractable answer set programming (2015)
  7. Gebser, Martin; Kaminski, Roland; Obermeier, Philipp; Schaub, Torsten: Ricochet robots reloaded: a case-study in multi-shot ASP solving (2015)
  8. Videla, Santiago; Guziolowski, Carito; Eduati, Federica; Thiele, Sven; Gebser, Martin; Nicolas, Jacques; Saez-Rodriguez, Julio; Schaub, Torsten; Siegel, Anne: Learning Boolean logic models of signaling networks with ASP (2015)
  9. Dvořák, Wolfgang; Järvisalo, Matti; Wallner, Johannes Peter; Woltran, Stefan: Complexity-sensitive decision procedures for abstract argumentation (2014)
  10. Göös, Mika; Lempiäinen, Tuomo; Czeizler, Eugen; Orponen, Pekka: Search methods for tile sets in patterned DNA self-assembly (2014)
  11. Riguzzi, Fabrizio; Swift, Terrance: Terminating evaluation of logic programs with finite three-valued models (2014)
  12. Andres, Benjamin; Gebser, Martin; Schaub, Torsten; Haubelt, Christian; Reimann, Felix; Glaß, Michael: Symbolic system synthesis using answer set programming (2013)
  13. Andres, Benjamin; Sauer, Matthias; Gebser, Martin; Schubert, Tobias; Becker, Bernd; Schaub, Torsten: Accurate computation of sensitizable paths using answer set programming (2013)
  14. Collet, Guillaume; Eveillard, Damien; Gebser, Martin; Prigent, Sylvain; Schaub, Torsten; Siegel, Anne; Thiele, Sven: Extending the metabolic network of Ectocarpus siliculosus using answer set programming (2013)
  15. Gebser, Martin; Jost, Holger; Kaminski, Roland; Obermeier, Philipp; Sabuncu, Orkunt; Schaub, Torsten; Schneider, Marius: Ricochet robots: a transverse ASP benchmark (2013)
  16. Schüller, Peter: Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming (2013)
  17. Alviano, Mario; Faber, Wolfgang; Greco, Gianluigi; Leone, Nicola: Magic sets for disjunctive Datalog programs (2012)
  18. Faber, Wolfgang; Leone, Nicola; Perri, Simona: The intelligent grounder of DLV (2012)
  19. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  20. Lee, Joohyung; Palla, Ravi: Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming (2012)

1 2 3 next

Further publications can be found at: