Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Abstract
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. The obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting aspartame and sugar.
Cite
@article{arxiv.1312.6113,
title = {Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming},
author = {Mutsunori Banbara and Martin Gebser and Katsumi Inoue and Torsten Schaub and Takehide Soh and Naoyuki Tamura and Matthias Weise},
journal= {arXiv preprint arXiv:1312.6113},
year = {2013}
}
Comments
Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey