IGMaxHS -- An Incremental MaxSAT Solver with Support for XOR Clauses
Fuente:
arXiv
Saved in:
| Main Author: | Lübke, Ole |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Enhancing Local Search for MaxSAT with Deep Differentiation Clause Weighting
by: Jiang, Menghua, et al.
Published: (2025)
by: Jiang, Menghua, et al.
Published: (2025)
Certified MaxSAT Preprocessing
by: Ihalainen, Hannes, et al.
Published: (2024)
by: Ihalainen, Hannes, et al.
Published: (2024)
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
by: Zheng, Jiongzhi, et al.
Published: (2024)
by: Zheng, Jiongzhi, et al.
Published: (2024)
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
by: Ye, Furong, et al.
Published: (2024)
by: Ye, Furong, et al.
Published: (2024)
LLM Routing as Reasoning: A MaxSAT View
by: Nguyen, Son, et al.
Published: (2026)
by: Nguyen, Son, et al.
Published: (2026)
An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rules
by: Júnior, Antônio Carlos Souza Ferreira, et al.
Published: (2024)
by: Júnior, Antônio Carlos Souza Ferreira, et al.
Published: (2024)
Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
by: Van Kieu, Tuyen, et al.
Published: (2026)
by: Van Kieu, Tuyen, et al.
Published: (2026)
A general optimization solver based on OP-to-MaxSAT reduction
by: Zhao, Yuxin, et al.
Published: (2026)
by: Zhao, Yuxin, et al.
Published: (2026)
Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localization
by: Orvalho, Pedro, et al.
Published: (2024)
by: Orvalho, Pedro, et al.
Published: (2024)
Redundancy rules for MaxSAT
by: Bonacina, Ilario, et al.
Published: (2025)
by: Bonacina, Ilario, et al.
Published: (2025)
Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
by: Engelhardt, Max, et al.
Published: (2025)
by: Engelhardt, Max, et al.
Published: (2025)
Resource-Constrained Heuristic for Max-SAT
by: Matejek, Brian, et al.
Published: (2024)
by: Matejek, Brian, et al.
Published: (2024)
MaxSAT decoders for arbitrary CSS codes
by: Noormandipour, Mohammadreza, et al.
Published: (2024)
by: Noormandipour, Mohammadreza, et al.
Published: (2024)
Decoding quantum color codes with MaxSAT
by: Berent, Lucas, et al.
Published: (2023)
by: Berent, Lucas, et al.
Published: (2023)
AutoSAT: Automatically Optimize SAT Solvers via Large Language Models
by: Sun, Yiwen, et al.
Published: (2024)
by: Sun, Yiwen, et al.
Published: (2024)
MILP-SAT-GNN: Yet Another Neural SAT Solver
by: Cardillo, Franco Alberto, et al.
Published: (2025)
by: Cardillo, Franco Alberto, et al.
Published: (2025)
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
by: Jha, Piyush, et al.
Published: (2024)
by: Jha, Piyush, et al.
Published: (2024)
HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems
by: Chen, Qiyue, et al.
Published: (2025)
by: Chen, Qiyue, et al.
Published: (2025)
Deeply Optimizing the SAT Solver for the IC3 Algorithm
by: Su, Yuheng, et al.
Published: (2025)
by: Su, Yuheng, et al.
Published: (2025)
Learning to Rank the Initial Branching Order of SAT Solvers
by: Eriksson, Arvid, et al.
Published: (2026)
by: Eriksson, Arvid, et al.
Published: (2026)
Dsat: A Native SAT Solver for Discrete Logic
by: Zhang, Yaofang, et al.
Published: (2026)
by: Zhang, Yaofang, et al.
Published: (2026)
Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)
by: Vandesande, Dieter, et al.
Published: (2025)
Efficient SAT and MaxSAT techniques for solving the Two-Dimensional Strip Packing Problem
by: Kieu, Tuyen Van, et al.
Published: (2025)
by: Kieu, Tuyen Van, et al.
Published: (2025)
Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, et al.
Published: (2025)
by: Davis, Liam, et al.
Published: (2025)
Rethinking Clause Management for CDCL SAT Solvers
by: Cai, Yalun, et al.
Published: (2026)
by: Cai, Yalun, et al.
Published: (2026)
GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
by: Zhang, Zhanguang, et al.
Published: (2024)
by: Zhang, Zhanguang, et al.
Published: (2024)
SAT, Gadgets, Max2XOR, and Quantum Annealers
by: Ansótegui, Carlos, et al.
Published: (2024)
by: Ansótegui, Carlos, et al.
Published: (2024)
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
by: Li, Chunxiao, et al.
Published: (2024)
by: Li, Chunxiao, et al.
Published: (2024)
A Geometric Perspective on the Difficulties of Learning GNN-based SAT Solvers
by: Skenderi, Geri
Published: (2025)
by: Skenderi, Geri
Published: (2025)
Dynamic Blocked Clause Elimination for Projected Model Counting
by: Lagniez, Jean-Marie, et al.
Published: (2024)
by: Lagniez, Jean-Marie, et al.
Published: (2024)
A Customized SAT-based Solver for Graph Coloring
by: Brand, Timo, et al.
Published: (2025)
by: Brand, Timo, et al.
Published: (2025)
Margin Propagation based XOR-SAT Solvers for Decoding of LDPC Codes
by: Nandi, Ankita, et al.
Published: (2024)
by: Nandi, Ankita, et al.
Published: (2024)
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
by: Bannach, Max, et al.
Published: (2024)
by: Bannach, Max, et al.
Published: (2024)
Efficient Neural Clause-Selection Reinforcement
by: Suda, Martin
Published: (2025)
by: Suda, Martin
Published: (2025)
Optimisation challenge for superconducting adiabatic neural network implementing XOR and OR boolean functions
by: Pashin, D. S., et al.
Published: (2024)
by: Pashin, D. S., et al.
Published: (2024)
Solving Cyclic Antibandwidth Problem by SAT
by: Xuan, Hieu Truong, et al.
Published: (2026)
by: Xuan, Hieu Truong, et al.
Published: (2026)
Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
by: Schwardt, J., et al.
Published: (2025)
by: Schwardt, J., et al.
Published: (2025)
Fast Analysis of the OpenAI O1-Preview Model in Solving Random K-SAT Problem: Does the LLM Solve the Problem Itself or Call an External SAT Solver?
by: Marino, Raffaele
Published: (2024)
by: Marino, Raffaele
Published: (2024)
Fuse, Reason and Verify: Geometry Problem Solving with Parsed Clauses from Diagram
by: Zhang, Ming-Liang, et al.
Published: (2024)
by: Zhang, Ming-Liang, et al.
Published: (2024)
Incremental and Data-Efficient Concept Formation to Support Masked Word Prediction
by: Lian, Xin, et al.
Published: (2024)
by: Lian, Xin, et al.
Published: (2024)
Similar Items
-
Enhancing Local Search for MaxSAT with Deep Differentiation Clause Weighting
by: Jiang, Menghua, et al.
Published: (2025) -
Certified MaxSAT Preprocessing
by: Ihalainen, Hannes, et al.
Published: (2024) -
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
by: Zheng, Jiongzhi, et al.
Published: (2024) -
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
by: Ye, Furong, et al.
Published: (2024) -
LLM Routing as Reasoning: A MaxSAT View
by: Nguyen, Son, et al.
Published: (2026)