BreakID: Static Symmetry Breaking for ASP (System Description)
Jo Devriendt, Bart Bogaerts

TL;DR
This paper introduces BreakID, a lightweight static symmetry breaking tool adapted from SAT solving, designed for integration in ASP workflows to improve solving efficiency.
Contribution
It adapts the state-of-the-art SAT symmetry breaker BreakID for ASP, providing a practical tool that enhances symmetry breaking in ASP solving processes.
Findings
BreakID effectively integrates into ASP workflows.
Compared to sbass, it offers competitive or improved symmetry breaking.
The tool is lightweight and easy to plug in.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · AI-based Problem Solving and Planning
