Gringo

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 65 articles )

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

1 2 3 4 next

  1. Brewka, Gerhard; Ellmauthaler, Stefan; Gonçalves, Ricardo; Knorr, Matthias; Leite, João; Pührer, Jörg: Reactive multi-context systems: heterogeneous reasoning in dynamic environments (2018)
  2. Aguado, Felicidad; Cabalar, Pedro; Pérez, Gilberto; Vidal, Concepción; Diéguez, Martín: Temporal logic programs with variables (2017)
  3. Harrison, Amelia; Lifschitz, Vladimir; Raju, Dhananjay: Program completion in the input language of GRINGO (2017)
  4. Lefèvre, Claire; Béatrix, Christopher; Stéphan, Igor; Garcia, Laurent: ASPeRiX, a first-order forward chaining approach for answer set computing (2017)
  5. Lierler, Yuliya: What is answer set programming to propositional satisfiability (2017)
  6. Bogaerts, Bart; Janhunen, Tomi; Tasharrofi, Shahab: Stable-unstable semantics: beyond NP with normal logic programs (2016)
  7. Dodaro, Carmine; Gasteiger, Philip; Leone, Nicola; Musitsch, Benjamin; Ricca, Francesco; Shchekotykhin, Kostyantyn: Combining answer set programming and domain heuristics for solving hard industrial problems (application paper) (2016)
  8. Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Redl, Christoph: Domain expansion for ASP-programs with external sources (2016)
  9. Gebser, Martin; Janhunen, Tomi; Kaminski, Roland; Schaub, Torsten; Tasharrofi, Shahab: Writing declarative specifications for clauses (2016)
  10. Alviano, Mario; Faber, Wolfgang; Gebser, Martin: Rewriting recursive aggregates in answer set programming: back to monotonicity (2015)
  11. Alviano, Mario; Peñaloza, Rafael: Fuzzy answer set computation via satisfiability modulo theories (2015)
  12. Calautti, Marco; Greco, Sergio; Spezzano, Francesca; Trubitsyna, Irina: Checking termination of bottom-up evaluation of logic programs with function symbols (2015)
  13. Eppe, Manfred; Bhatt, Mehul: Approximate postdictive reasoning with answer set programming (2015)
  14. Erdem, Esra; Oztok, Umut: Generating explanations for biomedical queries (2015)
  15. Falkner, Andreas; Ryabokon, Anna; Schenner, Gottfried; Shchekotykhin, Kostyantyn: OOASP: connecting object-oriented and logic programming (2015)
  16. Fichte, Johannes Klaus; Szeider, Stefan: Backdoors to tractable answer set programming (2015)
  17. Gebser, Martin; Kaminski, Roland; Obermeier, Philipp; Schaub, Torsten: Ricochet robots reloaded: a case-study in multi-shot ASP solving (2015)
  18. Koponen, Laura; Oikarinen, Emilia; Janhunen, Tomi; Säilä, Laura: Optimizing phylogenetic supertrees using answer set programming (2015)
  19. Manna, Marco; Ricca, Francesco; Terracina, Giorgio: Taming primary key violations to query large inconsistent data via ASP (2015)
  20. 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)

1 2 3 4 next


Further publications can be found at: http://www.emsl.pnl.gov/docs/parsoft/armci/papers.htm