DualGrounder: Lazy answer set solver
Answer set programming (ASP) is a declarative programming paradigm that is geared towards difficult combinatorial search problems. Sometimes, run times of ASP systems suffer due to so called grounding bottleneck. Lazy grounding solvers aim to mitigate this issue. DualGroudner is a lazy grounding solver. The DualGrounder system leverages multi-shot capabilities of the advanced ASP platform Clingo version 5.
DualGrounder is available at the following link (under MIT license).
Theoretical and practical groundings for DualGrounder can be found in:
- Justin Robbins and Yuliya Lierler. DualGrounder: Lazy instantiation via Clingo multi-shot framework (PDF). Technical Report, 2020. Benchmarks discussed in this paper are posted here.
Comments, questions, and/or bugs can be reported to Justin Robbins and Yuliya Lierler