Cover Image

Orbitopal Fixing in SAT

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anders, Markus, Codel, Cayden, Heule, Marijn J. H.
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Formal Verification of the Empty Hexagon Number
by: Subercaseaux, Bernardo, et al.
Published: (2024)

Happy Ending: An Empty Hexagon in Every Set of 30 Points
by: Heule, Marijn J. H., et al.
Published: (2024)

Orthologic for SAT Solving
by: de Haldat, Vladislas, et al.
Published: (2026)

Automated Reencoding Meets Graph Theory
by: Przybocki, Benjamin, et al.
Published: (2026)

Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
by: Van Kieu, Tuyen, et al.
Published: (2026)

Learning to Rank the Initial Branching Order of SAT Solvers
by: Eriksson, Arvid, et al.
Published: (2026)

Dsat: A Native SAT Solver for Discrete Logic
by: Zhang, Yaofang, et al.
Published: (2026)

Deeply Optimizing the SAT Solver for the IC3 Algorithm
by: Su, Yuheng, et al.
Published: (2025)

Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, et al.
Published: (2025)

A SAT-based approach to rigorous verification of Bayesian networks
by: Stępka, Ignacy, et al.
Published: (2024)

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
by: Kim, Curie, et al.
Published: (2026)

Automatically discovering heuristics in a complex SAT solver with large language models
by: Sun, Yiwen, et al.
Published: (2025)

A general optimization solver based on OP-to-MaxSAT reduction
by: Zhao, Yuxin, et al.
Published: (2026)

Certified Knowledge Compilation with Application to Formally Verified Model Counting
by: Bryant, Randal E., et al.
Published: (2025)

Can Transformers Reason Logically? A Study in SAT Solving
by: Pan, Leyan, et al.
Published: (2024)

Transfer Learning from Foundational Optimization Embeddings to Unsupervised SAT Representations
by: Pal, Koyena, et al.
Published: (2026)

A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
by: Li, Chunxiao, et al.
Published: (2024)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
by: Hecher, Markus, et al.
Published: (2024)

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

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
by: Beiser, Alexander, et al.
Published: (2025)

Towards Mass Spectrum Analysis with ASP
by: Küchenmeister, Nils, et al.
Published: (2025)

Finite Groundings for ASP with Functions: A Journey through Consistency
by: Gerlach, Lukas, et al.
Published: (2024)

Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description)
by: Lellmann, Björn, et al.
Published: (2024)

Iof-maint -- Modular maintenance ontology
by: Hodkiewicz, Melinda, et al.
Published: (2024)

SATBench: Benchmarking LLMs' Logical Reasoning via Automated Puzzle Generation from SAT Formulas
by: Wei, Anjiang, et al.
Published: (2025)

The logic of KM belief update is contained in the logic of AGM belief revision
by: Bonanno, Giacomo
Published: (2026)

First Order Logic with Fuzzy Semantics for Describing and Recognizing Nerves in Medical Images
by: Bloch, Isabelle, et al.
Published: (2025)

Abductive Reasoning in a Paraconsistent Framework
by: Bienvenu, Meghyn, et al.
Published: (2024)

Policy-Adaptable Methods For Resolving Normative Conflicts Through Argumentation and Graph Colouring
by: Joyce, Johnny
Published: (2025)

Dynamic Logic of Trust-Based Beliefs
by: Jiang, Junli, et al.
Published: (2025)

Similarity-based analogical proportions
by: Antić, Christian
Published: (2024)

An Automated Theorem Generator with Theoretical Foundation Based on Rectangular Standard Contradiction
by: Xu, Yang, et al.
Published: (2025)

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
by: Zhang, Zhiwei, et al.
Published: (2025)

A Reduction of Input/Output Logics to SAT
by: Steen, Alexander
Published: (2025)

Finding hardness reductions automatically using SAT solvers
by: Bergold, Helena, et al.
Published: (2024)

Tao's Equational Proof Challenge Accepted (Technical Report)
by: Kondylidou, Lydia, et al.
Published: (2026)

TurboSAT: Gradient-Guided Boolean Satisfiability Accelerated on GPU-CPU Hybrid System
by: Dai, Steve, et al.
Published: (2025)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
by: Faber, Daniel, et al.
Published: (2024)

When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT (Extended Version)
by: Filipe, João, et al.
Published: (2026)

Epistemic Logic Programs: Non-Ground and Counting Complexity
by: Eiter, Thomas, et al.
Published: (2025)