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.
| Original language | English |
|---|---|
| Pages | 25-39 |
| Number of pages | 15 |
| Publication status | Published - 2016 |
| MoE publication type | Not Eligible |
| Event | Workshop on Answer Set Programming and Other Computing Paradigms - New York, United States Duration: 16 Oct 2016 → 16 Oct 2016 Conference number: 9 https://sites.google.com/site/aspocp2016/home |
Workshop
| Workshop | Workshop on Answer Set Programming and Other Computing Paradigms |
|---|---|
| Abbreviated title | ASPOCP |
| Country/Territory | United States |
| City | New York |
| Period | 16/10/2016 → 16/10/2016 |
| Internet address |
Funding
This research was supported by the project GOA 13/010 Research Fund KU Leuven and projects G.0489.10, G.0357.12 and G.0922.13 of FWO (Research Foundation - Flanders). Bart Bogaerts is supported by the Finnish Center of Excellence in Computational Inference Research (COIN) funded by the Academy of Finland (grant #251170).