Breaking Symmetries in Quantified Graph Search: A Comparative Study

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Janota, Mikoláš, Kirchweger, Markus, Peitl, Tomáš, Szeider, Stefan
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)

Breaking Symmetries from a Set-Covering Perspective
by: Codish, Michael, et al.
Published: (2025)

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

Small unsatisfiable $k$-CNFs with bounded literal occurrence
by: Zhang, Tianwei, et al.
Published: (2024)

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

Smart Cubing for Graph Search: A Comparative Study
by: Kirchweger, Markus, et al.
Published: (2025)

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

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

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)

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)

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

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

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

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

Better Extension Variables in DQBF via Independence
by: Chew, Leroy, et al.
Published: (2025)

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

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

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

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
by: Szeider, Stefan
Published: (2026)

ASP-Bench: From Natural Language to Logic Programs
by: Szeider, Stefan
Published: (2026)

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025)

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

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

Streamliners for Answer Set Programming
by: Voboril, Florentina, et al.
Published: (2026)

Compilation and Fast Model Counting beyond CNF
by: de Colnet, Alexis, et al.
Published: (2025)

Hard QBFs for Merge Resolution
by: Beyersdorff, Olaf, et al.
Published: (2020)

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

Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012)

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

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

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Support is Search
by: Gheorghiu, Alexander V.
Published: (2026)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
by: Lyon, Tim S., et al.
Published: (2026)

Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
by: Lipparini, Enrico, et al.
Published: (2023)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

From Quantifier Depth to Quantifier Number: Separating Structures with k Variables
by: Vinall-Smeeth, Harry
Published: (2023)