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

arXiv: https://arxiv.org/abs/1707.04027 · HTML: https://mlsanity.com/paper/1707.04027/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jul 2017.

## Built on by (most cited first, 1 of 1)

- [Extended High Utility Pattern Mining: An Answer Set Programming Based Framework and Applications](https://mlsanity.com/paper/2303.13191/) (2023)

## Abstract (arXiv)

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