AIAug 30, 2016

BreakID: Static Symmetry Breaking for ASP (System Description)

arXiv:1608.08447v111 citations
Originality Synthesis-oriented
AI Analysis

This work addresses symmetry breaking for ASP users, but it is incremental as it adapts an existing SAT method to ASP.

The authors tackled the problem of symmetry breaking in answer set programming (ASP) by porting the state-of-the-art SAT symmetry breaker BreakID to ASP, resulting in a lightweight tool that can be integrated between grounding and solving phases.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes