Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving

03/29/2019
by   Richard Taupe, et al.
0

The traditional ground-and-solve approach to Answer Set Programming (ASP) suffers from the grounding bottleneck, which makes large-scale problem instances unsolvable. Lazy grounding is an alternative approach that interleaves grounding with solving and thus uses space more efficiently. The limited view on the search space in lazy grounding poses unique challenges, however, and can have adverse effects on solving performance. In this paper we present a novel characterization of degrees of laziness in grounding for ASP, i.e. of compromises between lazily grounding as little as possible and the traditional full grounding upfront. We investigate how these degrees of laziness compare to each other formally as well as, by means of an experimental analysis using a number of benchmarks, in terms of their effects on solving performance. Our contributions are the introduction of a range of novel lazy grounding strategies, a formal account on their relationships and their correctness, and an investigation of their effects on solving performance. Experiments show that our approach performs significantly better than state-of-the-art lazy grounding in many cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2020

Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More

Answer-Set Programming (ASP) is a powerful and expressive knowledge repr...
research
09/17/2021

Compilation of Aggregates in ASP

Answer Set Programming (ASP) is a well-known problem-solving formalism i...
research
08/07/2020

Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints

Generalising and re-using knowledge learned while solving one problem in...
research
03/12/2016

Grounding Recursive Aggregates: Preliminary Report

Problem solving in Answer Set Programming consists of two steps, a first...
research
09/06/2011

Lifted Unit Propagation for Effective Grounding

A grounding of a formula ϕ over a given finite domain is a ground formul...
research
05/27/2017

Multi-shot ASP solving with clingo

We introduce a new flexible paradigm of grounding and solving in Answer ...
research
09/19/2022

Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming

Domain-specific heuristics are an essential technique for solving combin...

Please sign up or login with your details

Forgot password? Click here to reset