Complete Symmetry Breaking for Finite Models
Marek Danco, Mikolás Janota, Michael Codish, João Jorge Araújo
Abstract
This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically described as first-order logic formulas and the concrete algebras are models of these formulas. Such models include an enormous number of isomorphic, i.e. symmetric, algebras.
A complete symmetry-break is a formula that has as models, exactly one canonical representative from each equivalence class of algebras. Thus, we enable answering questions about properties of the models so that computation and search are restricted to the set of canonical representations.
For instance, we can answer the question: How many non-isomorphic semigroups are there of size n? Such questions can be answered by counting the satisfying assignments of a SAT formula, which already filters out non-isomorphic models. The introduced technique enables us calculating numbers of algebraic structures not present in the literature and going beyond the possibilities of pure enumeration approaches.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2be82392-9989-499a-8d1d-b208fa2ba884Builds on2
Related papers
- SymMC: approximate model enumeration and counting using symmetry information for Alloy specificationsWenxi Wang, Yang Hu, Kenneth L. McMillan, Sarfraz KhurshidFSE 2022
- Faster Symmetry Breaking Constraints for Abstract StructuresÖzgür Akgün, Mun See Chang, Ian P. Gent, Christopher JeffersonAAAI 2026
- Symmetric Component Caching for Model Counting on Combinatorial InstancesTimothy van Bremen, Vincent Derkinderen, Shubham Sharma, Subhajit Roy et al.AAAI 2021 · 6 citations
- Breaking Symmetries in Quantified Graph Search: A Comparative StudyMikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan SzeiderAAAI 2025 · 2 citations
- Constraint Satisfaction Problems over Finite StructuresLibor Barto, William J. DeMeo, Antoine MottetLICS 2021 · 2 citations
