GASP

swMATH7096MaRDI QIDQ19154FDOQ19154

Author name not available (Why is that?)

Described by source

• GASP: Answer set programming with lazy grounding

Cited In (16)

• Constraint answer set programming without grounding
• A model building framework for answer set programming with external computations
• Answer Set Programming: A Primer
• The power of non-ground rules in Answer Set Programming
• Abstraction for non-ground answer set programs
• Title not available (Why is that?)
• Incremental maintenance of overgrounded logic programs with tailored simplifications
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Incremental answer set programming with overgrounding
• Design and results of the Fifth Answer Set Programming Competition
• Title not available (Why is that?)
• Partial compilation of ASP programs
• Optimizing answer set computation via heuristic-based decomposition
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• Integrating grounding in the search process for answer set computing

This page was built for software: GASP