REVIEW 2 cited by
BreakID: Static Symmetry Breaking for ASP (System Description)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
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.
-
Table-based Quantifier Elimination
A relational-algebra grounder called xmt-lib uses x-generators to finitely expand guarded quantified formulas over infinite domains, making Z3 competitive with ASP solvers on the DIRT benchmark.
Discussion (0). Continue with ORCID to comment.