Cited in
(41)- DualGrounder
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- Integrating grounding in the search process for answer set computing
- Constraint answer set programming without grounding
- Incremental maintenance of overgrounded logic programs with tailored simplifications
- Partial compilation of ASP programs
- Abstraction for non-ground answer set programs
- Optimizing answer set computation via heuristic-based decomposition
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- Answer Set Programming: A Primer
- ASPeRiX
- GNT
- ASSAT
- Cmodels
- DLV-EX
- Gringo
- Lparse
- clasp
- NoMoRe
- Design and results of the Fifth Answer Set Programming Competition
- Galliwasp
- DMCS
- Clingcon
- Clingo
- WASP
- Datalog
- Lpopt
- asprilo
- ezcsp
- DLV2
- modopt
- OMiGA
- pyrunlim
- CPCES
- A model building framework for answer set programming with external computations
- scientific article; zbMATH DE number 7453150 (Why is no real title available?)
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Incremental answer set programming with overgrounding
- The power of non-ground rules in Answer Set Programming
- sCASP
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
This page was built for software: GASP
