Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis

by   Bernardo Cuteri, et al.

Answer Set Programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications this approach is infeasible because the grounding of one or few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, that are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies. (Under consideration for acceptance in TPLP, ICLP 2017 Special Issue.)


page 1

page 2

page 3

page 4


Compilation of Aggregates in ASP

Answer Set Programming (ASP) is a well-known problem-solving formalism i...

Constraint Answer Set Programming without Grounding

Extending ASP with constraints (CASP) enhances its expressiveness and pe...

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

Answer-Set Programming (ASP) is a powerful and expressive knowledge repr...

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

Generalising and re-using knowledge learned while solving one problem in...

Clingo goes Linear Constraints over Reals and Integers

The recent series 5 of the ASP system clingo provides generic means to e...

An ASP-based Solution to the Chemotherapy Treatment Scheduling problem

The problem of scheduling chemotherapy treatments in oncology clinics is...

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning

We present an approach to representing large sets of mutual exclusions, ...