BreakID: Static Symmetry Breaking for ASP (System Description)
classification
💻 cs.AI
keywords
symmetrybreakerbreakidbreakingsolvingstate-of-the-arttoolanswer
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Streamliners for Answer Set Programming
LLM-proposed streamliner constraints for ASP encodings, filtered and combined via virtual best selection, deliver up to 4-5x speedups on three competition benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.