clasp : A Conflict-Driven Answer Set Solver
By Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub. International Conference on Logic Programming and Non-Monotonic Reasoning, 2007
371 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/2248c8e993ca96a9c38a0873a3c0e51882d8c0d7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Benjamin Kaufmann
- Torsten Schaub
- Martin Gebser
- Roland Kaminski
- Antti Hyttinen
- Matti Järvisalo
- Frederick Eberhardt
Citations in the corpus
- Potassco: The Potsdam Answer Set Solving Collection (2011, neutral): “The robustness of clasp is boosted by multiple advanced restart strategies, namely, geometric, fixed-interval, Luby-style, or a nested policy (see [46,50] for details), configurable via option --restarts .”
- Conflict-driven answer set solving: From theory to practice (2012, methodology): “Our approach to conflict-driven ASP solving is implemented in clasp [54,52,56], combining the high-level modeling capacities of ASP with state-of-the-art Boolean constraint solving techniques.”