Techniques for Efficient Lazy-Grounding ASP Solving

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa

Tutkijat

  • Lorenz Leutgeb
  • Antonius Weinzierl

Organisaatiot

  • Vienna University of Technology

Kuvaus

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.

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoDeclare 2017 - Conference on Declarative Programming
ToimittajatDietmar Seipel, Michael Hanus, Salvador Abreu
TilaJulkaistu - 14 syyskuuta 2017
OKM-julkaisutyyppiD3 Ammatillisen konferenssin julkaisusarja
TapahtumaInternational Conference on Applications of Declarative Programming and Knowledge Management - Würzburg, Saksa
Kesto: 19 syyskuuta 201721 syyskuuta 2017
Konferenssinumero: 21
http://declare17.de/inap/

Conference

ConferenceInternational Conference on Applications of Declarative Programming and Knowledge Management
LyhennettäINAP
MaaSaksa
KaupunkiWürzburg
Ajanjakso19/09/201721/09/2017
www-osoite

ID: 16807829