GASP

swMATH7096MaRDI QIDQ19154FDOQ19154

Author name not available (Why is that?)

Described by source

• GASP: Answer Set Programming with Lazy Grounding

Cited In (16)

• A model building framework for answer set programming with external computations
• Answer Set Programming: A Primer
• Incremental Answer Set Programming with Overgrounding
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• The power of non-ground rules in Answer Set Programming
• Partial Compilation of ASP Programs
• Abstraction for non-ground answer set programs
• Title not available (Why is that?)
• Incremental maintenance of overgrounded logic programs with tailored simplifications
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Constraint Answer Set Programming without Grounding
• Design and results of the Fifth Answer Set Programming Competition
• Title not available (Why is that?)
• Title not available (Why is that?)
• ASPeRiX, a first-order forward chaining approach for answer set computing

This page was built for software: GASP