BreakID: Static Symmetry Breaking for ASP (System Description)
Artificial Intelligence
2016-08-31 v1
Abstract
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the current state-of-the-art symmetry breaker for ASP.
Keywords
Cite
@article{arxiv.1608.08447,
title = {BreakID: Static Symmetry Breaking for ASP (System Description)},
author = {Jo Devriendt and Bart Bogaerts},
journal= {arXiv preprint arXiv:1608.08447},
year = {2016}
}
Comments
Paper presented at the 9th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2016), New York City, USA, 16 October 2016