Cover Image

Breaking Symmetries from a Set-Covering Perspective

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Codish, Michael, Janota, Mikoláš
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Breaking Symmetries with Involutions
by: Codish, Michael, et al.
Published: (2025)

Complete Symmetry Breaking for Finite Models
by: Dančo, Marek, et al.
Published: (2025)

SAT-Based Techniques for Lexicographically Smallest Finite Models
by: Janota, Mikoláš, et al.
Published: (2025)

Breaking Symmetries in Quantified Graph Search: A Comparative Study
by: Janota, Mikoláš, et al.
Published: (2025)

Experimental Results for Vampire on the Equational Theories Project
by: Janota, Mikoláš
Published: (2025)

LLM2SMT: Building an SMT Solver with Zero Human-Written Code
by: Janota, Mikoláš, et al.
Published: (2026)

Case Study: Saturations as Explicit Models in Equational Theories
by: Janota, Mikoláš, et al.
Published: (2026)

Quantifier Instantiations: To Mimic or To Revolt?
by: Jakubův, Jan, et al.
Published: (2025)

Towards Learning Infinite SMT Models (Work in Progress)
by: Janota, Mikoláš, et al.
Published: (2025)

From MBQI to Enumerative Instantiation and Back
by: Dančo, Marek, et al.
Published: (2025)

First Experiments with Neural cvc5
by: Piepenbrock, Jelle, et al.
Published: (2025)

Cube-based Isomorph-free Finite Model Finding
by: Chow, Choiwah, et al.
Published: (2025)

Symbolic Computation for All the Fun
by: Brown, Chad E., et al.
Published: (2024)

Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
by: Ratschan, Stefan, et al.
Published: (2026)

Reintroducing the Second Player in EPR
by: Chew, Leroy, et al.
Published: (2026)

CFaults: Model-Based Diagnosis for Fault Localization in C Programs with Multiple Test Cases
by: Orvalho, Pedro, et al.
Published: (2024)

Solving Hard Mizar Problems with Instantiation and Strategy Invention
by: Jakubův, Jan, et al.
Published: (2024)

SMT and Functional Equation Solving over the Reals: Challenges from the IMO
by: Brown, Chad E., et al.
Published: (2025)

Machine Learning for Quantifier Selection in cvc5
by: Jakubův, Jan, et al.
Published: (2024)

Model-Based Diagnosis with Multiple Observations: A Unified Approach for C Software and Boolean Circuits
by: Orvalho, Pedro, et al.
Published: (2025)

Automatic Generation of Polynomial Symmetry Breaking Constraints
by: Erascu, Madalina, et al.
Published: (2026)

Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables
by: Anders, Markus, et al.
Published: (2025)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
by: Gratzer, Daniel, et al.
Published: (2024)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
by: Kihara, Takayuki
Published: (2024)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
by: Takahashi, Yuta
Published: (2024)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

Choiceless Computation and Symmetry: Limitations of Definability
by: Pago, Benedikt
Published: (2024)

Symmetries of Dependency Quantified Boolean Formulas
by: Hofstadler, Clemens, et al.
Published: (2024)

Logic of Sets with Atoms
by: Masters, Jake
Published: (2025)

The Groupoid-Syntax of Type Theory is a Set
by: Altenkirch, Thorsten, et al.
Published: (2025)

A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on
by: Lenke, Fabian, et al.
Published: (2026)

A Categorical Foundation of Rough Sets
by: Kakutani, Yoshihiko
Published: (2025)

Hammering Higher Order Set Theory
by: Brown, Chad E., et al.
Published: (2025)

Are Dependent Types in Set Theory Feasible?
by: Yang, Yunsong, et al.
Published: (2026)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

Solving Set Constraints with Comprehensions and Bounded Quantifiers
by: Mohamed, Mudathir, et al.
Published: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
by: Niwiński, Damian, et al.
Published: (2023)

Set-like operations on propositional logic programs
by: Antić, Christian
Published: (2026)