GASP: Answer Set Programming with Lazy Grounding

DOI10.3233/FI-2009-180zbMath1207.68118OpenAlexW2121444716MaRDI QIDQ3400569

Enrico Pontelli, A. Dal Palú, Gianfranco Rossi, Agostino Dovier

Publication date: 5 February 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-180

zbMATH Keywords

non-monotonic reasoninglogic programminganswer set programmin

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (20)

The Design of the Sixth Answer Set Programming Competition ⋮ Constraint Answer Set Programming without Grounding ⋮ Unnamed Item ⋮ Parallel Logic Programming: A Sequel ⋮ A model building framework for answer set programming with external computations ⋮ The power of non-ground rules in Answer Set Programming ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Partial Compilation of ASP Programs ⋮ Incremental Answer Set Programming with Overgrounding ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ Incremental maintenance of overgrounded logic programs with tailored simplifications ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Abstraction for non-ground answer set programs ⋮ DualGrounder: lazy instantiation via clingo multi-shot framework ⋮ GASP ⋮ Answer Set Programming: A Primer

Uses Software

• ASSAT
• Cmodels
• Smodels
• clasp

This page was built for publication: GASP: Answer Set Programming with Lazy Grounding