no code implementations • 27 May 2017 • Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo.
no code implementations • 12 May 2017 • Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub
While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp.