clasp

clasp: A conflict-driven answer set solver. clasp is part of the Potassco project hosted at SourceForge. Source code and pre-compiled binaries are available on the Potassco download page. clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set programming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo), as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB solver (on OPB format).


References in zbMATH (referenced in 90 articles )

Showing results 61 to 80 of 90.
Sorted by year (citations)
  1. Fink, Michael: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there (2011)
  2. Gebser, Martin; Kaminski, Roland; Kaufmann, Benjamin; Schaub, Torsten; Schneider, Marius Thomas; Ziller, Stefan: A portfolio solver for answer set programming: preliminary report (2011) ioport
  3. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)
  4. Gebser, Martin; Schaub, Torsten; Thiele, Sven; Veber, Philippe: Detecting inconsistencies in large biological networks with answer set programming (2011)
  5. Marek, Victor; Remmel, Jeffrey B.: Effectively reasoning about infinite sets in answer set programming (2011)
  6. Marques-Silva, Joao; Argelich, Josep; Graça, Ana; Lynce, Inês: Boolean lexicographic optimization: algorithms & applications (2011)
  7. Mileo, Alessandra; Schaub, Torsten; Merico, Davide; Bisiani, Roberto: Knowledge-based multi-criteria optimization to support indoor positioning (2011)
  8. Möller, Maximilian; Schneider, Marius; Wegner, Martin; Schaub, Torsten: Centurio, a general game player: parallel, Java- and ASP-based (2011) ioport
  9. Sérayet, Mariette; Drap, Pierre; Papini, Odile: Extending Removed Sets Revision to partially preordered belief bases (2011)
  10. Dovier, Agostino; Formisano, Andrea; Pontelli, Enrico: Multivalued action languages with constraints in (CLP(FD)) (2010)
  11. Drescher, Christian: Constraint answer set programming systems (2010)
  12. Drescher, Christian; Walsh, Toby: A translational approach to constraint answer set solving (2010)
  13. Liu, Lengning; Pontelli, Enrico; Son, Tran Cao; Truszczyński, Miroslaw: Logic programs with abstract constraint atoms: the role of computations (2010)
  14. Morgado, António; Marques-Silva, Joao: Combinatorial optimization solutions for the maximum quartet consistency problem (2010)
  15. Dal Palù, Alessandro; Dovier, Agostino; Pontelli, Enrico; Rossi, Gianfranco: GASP: Answer set programming with lazy grounding (2009)
  16. Delgrande, James P.; Grote, Torsten; Hunter, Aaron: A general approach to the verification of cryptographic protocols using answer set programming (2009)
  17. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: The conflict-driven answer set solver clasp: progress report (2009) ioport
  18. Gebser, Martin; Ostrowski, Max; Schaub, Torsten: Constraint answer set solving (2009)
  19. Ishebabi, Harold; Mahr, Philipp; Bobda, Christophe; Gebser, Martin; Schaub, Torsten: Answer set versus integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs (2009) ioport
  20. Janhunen, Tomi; Niemelä, Ilkka; Sevalnev, Mark: Computing stable models via reductions to difference logic (2009)