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

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

1 2 next

  1. 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)
  2. Hoos, Holger; Lindauer, Marius; Schaub, Torsten: claspfolio 2: advances in algorithm selection for answer set programming (2014)
  3. Hurley, Barry; Kotthoff, Lars; Malitsky, Yuri; O’Sullivan, Barry: Proteus: a hierarchical portfolio of solvers and transformations (2014)
  4. Muggleton, Stephen H.; Lin, Dianhuan; Pahlavi, Niels; Tamaddoni-Nezhad, Alireza: Meta-interpretive learning: application to grammatical inference (2014)
  5. Andres, Benjamin; Gebser, Martin; Schaub, Torsten; Haubelt, Christian; Reimann, Felix; Glaß, Michael: Symbolic system synthesis using answer set programming (2013)
  6. Andres, Benjamin; Sauer, Matthias; Gebser, Martin; Schubert, Tobias; Becker, Bernd; Schaub, Torsten: Accurate computation of sensitizable paths using answer set programming (2013)
  7. Benhamou, Belaïd: Dynamic and static symmetry breaking in answer set programming (2013)
  8. 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)
  9. Gebser, Martin; Jost, Holger; Kaminski, Roland; Obermeier, Philipp; Sabuncu, Orkunt; Schaub, Torsten; Schneider, Marius: Ricochet robots: a transverse ASP benchmark (2013)
  10. Marple, Kyle; Gupta, Gopal: Galliwasp: a goal-directed answer set solver (2013)
  11. Morgado, Antonio; Heras, Federico; Liffiton, Mark; Planes, Jordi; Marques-Silva, Joao: Iterative and core-guided maxsat solving: a survey and assessment (2013)
  12. Schüller, Peter: Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming (2013)
  13. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  14. Janičić, Predrag: URSA: a system for uniform reduction to SAT (2012)
  15. Balduccini, Marcello: Learning and using domain-specific heuristics in ASP solvers (2011)
  16. Drescher, Christian; Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Walsh, Toby: Symmetry breaking for distributed multi-context systems (2011)
  17. Faber, Wolfgang; Leone, Nicola; Maratea, Marco; Ricca, Francesco: Look-back techniques for ASP programs with aggregates (2011)
  18. Fink, Michael: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there (2011)
  19. Gebser, Martin; Kaminski, Roland; Kaufmann, Benjamin; Schaub, Torsten; Schneider, Marius Thomas; Ziller, Stefan: A portfolio solver for answer set programming: preliminary report (2011)
  20. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)

1 2 next