Techniques for Efficient Lazy-Grounding ASP Solving

Lorenz Leutgeb, Antonius Weinzierl

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsProfessional


Answer-Set Programming (ASP) is a well-known and expressive logic programming paradigm based on efficient solvers. State-of-theart ASP solvers require the ASP program to be variable-free, they thus ground the program upfront at the cost of a potential exponential explosion of the space required. Lazy-grounding, where solving and grounding are interleaved, circumvents this grounding bottleneck, but the resulting solvers lack many important search techniques and optimizations. The recently introduced ASP solver Alpha combines lazy-grounding with conflict-driven nogood learning (CDNL), a core technique of efficient ASP solving. This work presents how techniques for efficient propagation can be lifted to the lazy-grounding setting. The Alpha solver and its components are presented and detailed benchmarks comparing Alpha to other ASP solvers demonstrate the feasibility of this approach.
Original languageEnglish
Title of host publicationDeclare 2017 - Conference on Declarative Programming
EditorsDietmar Seipel, Michael Hanus, Salvador Abreu
PublisherUniversity of Würzburg
Number of pages16
Publication statusPublished - 14 Sept 2017
MoE publication typeD3 Professional conference proceedings
EventInternational Conference on Applications of Declarative Programming and Knowledge Management - Würzburg, Germany
Duration: 19 Sept 201721 Sept 2017
Conference number: 21


ConferenceInternational Conference on Applications of Declarative Programming and Knowledge Management
Abbreviated titleINAP
Internet address


Dive into the research topics of 'Techniques for Efficient Lazy-Grounding ASP Solving'. Together they form a unique fingerprint.

Cite this