Techniques for Efficient Lazy-Grounding ASP Solving

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

Standard

Techniques for Efficient Lazy-Grounding ASP Solving. / Leutgeb, Lorenz; Weinzierl, Antonius.

Declare 2017 - Conference on Declarative Programming. ed. / Dietmar Seipel; Michael Hanus; Salvador Abreu. 2017. p. 123-138.

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

Harvard

Leutgeb, L & Weinzierl, A 2017, Techniques for Efficient Lazy-Grounding ASP Solving. in D Seipel, M Hanus & S Abreu (eds), Declare 2017 - Conference on Declarative Programming. pp. 123-138, International Conference on Applications of Declarative Programming and Knowledge Management , Würzburg, Germany, 19/09/2017.

APA

Leutgeb, L., & Weinzierl, A. (2017). Techniques for Efficient Lazy-Grounding ASP Solving. In D. Seipel, M. Hanus, & S. Abreu (Eds.), Declare 2017 - Conference on Declarative Programming (pp. 123-138)

Vancouver

Leutgeb L, Weinzierl A. Techniques for Efficient Lazy-Grounding ASP Solving. In Seipel D, Hanus M, Abreu S, editors, Declare 2017 - Conference on Declarative Programming. 2017. p. 123-138

Author

Leutgeb, Lorenz ; Weinzierl, Antonius. / Techniques for Efficient Lazy-Grounding ASP Solving. Declare 2017 - Conference on Declarative Programming. editor / Dietmar Seipel ; Michael Hanus ; Salvador Abreu. 2017. pp. 123-138

Bibtex - Download

@inproceedings{96b6976df7014462bd5407d3d1d1118c,
title = "Techniques for Efficient Lazy-Grounding ASP Solving",
abstract = "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.",
author = "Lorenz Leutgeb and Antonius Weinzierl",
year = "2017",
month = "9",
day = "14",
language = "English",
pages = "123--138",
editor = "Dietmar Seipel and Michael Hanus and Salvador Abreu",
booktitle = "Declare 2017 - Conference on Declarative Programming",

}

RIS - Download

TY - GEN

T1 - Techniques for Efficient Lazy-Grounding ASP Solving

AU - Leutgeb, Lorenz

AU - Weinzierl, Antonius

PY - 2017/9/14

Y1 - 2017/9/14

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 123

EP - 138

BT - Declare 2017 - Conference on Declarative Programming

A2 - Seipel, Dietmar

A2 - Hanus, Michael

A2 - Abreu, Salvador

ER -

ID: 16807829