Breakid: Static symmetry breaking for ASP (system description)

Jo Devriendt, Bart Bogaerts

Research output: Contribution to conferencePaperScientificpeer-review

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 languageEnglish
Pages25-39
Number of pages15
Publication statusPublished - 2016
MoE publication typeNot Eligible
EventWorkshop on Answer Set Programming and Other Computing Paradigms - New York, United States
Duration: 16 Oct 201616 Oct 2016
Conference number: 9
https://sites.google.com/site/aspocp2016/home

Workshop

WorkshopWorkshop on Answer Set Programming and Other Computing Paradigms
Abbreviated titleASPOCP
Country/TerritoryUnited States
CityNew York
Period16/10/201616/10/2016
Internet address

Fingerprint

Dive into the research topics of 'Breakid: Static symmetry breaking for ASP (system description)'. Together they form a unique fingerprint.

Cite this