Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems
David E. Narv\'aez

TL;DR
This paper investigates the application of Shatter for symmetry breaking in AllSAT problems related to Ramsey theory, highlighting its drawbacks and proposing strategies to mitigate issues like model blow-up and incomplete solutions.
Contribution
It identifies key challenges in using Shatter for AllSAT in Ramsey problems and offers practical strategies to improve its effectiveness and reliability.
Findings
Shatter can cause a blow-up in the number of models.
Naive use of Shatter may lead to incomplete sets of solutions.
Proposed strategies help mitigate these issues in symmetry breaking.
Abstract
In the context of SAT solvers, Shatter is a popular tool for symmetry breaking on CNF formulas. Nevertheless, little has been said about its use in the context of AllSAT problems: problems where we are interested in listing all the models of a Boolean formula. AllSAT has gained much popularity in recent years due to its many applications in domains like model checking, data mining, etc. One example of a particularly transparent application of AllSAT to other fields of computer science is computational Ramsey theory. In this paper we study the effect of incorporating Shatter to the workflow of using Boolean formulas to generate all possible edge colorings of a graph avoiding prescribed monochromatic subgraphs. Generating complete sets of colorings is an important building block in computational Ramsey theory. We identify two drawbacks in the na\"ive use of Shatter to break the symmetries…
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
TopicsConstraint Satisfaction and Optimization · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms
