Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
Abstract
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.)
Keywords
Cite
@article{arxiv.1707.04027,
title = {Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis},
author = {Bernardo Cuteri and Carmine Dodaro and Francesco Ricca and Peter Schüller},
journal= {arXiv preprint arXiv:1707.04027},
year = {2018}
}
Comments
Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017. 16 pages