Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zheng, Jiongzhi, Chen, Zhuo, Li, Chu-Min, He, Kun
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
by: Ye, Furong, et al.
Published: (2024)

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)

IGMaxHS -- An Incremental MaxSAT Solver with Support for XOR Clauses
by: Lübke, Ole
Published: (2024)

LLM Routing as Reasoning: A MaxSAT View
by: Nguyen, Son, et al.
Published: (2026)

ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
by: Chen, Zhihan, 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)

Counterexample Guided Program Repair Using Zero-Shot Learning and MaxSAT-based Fault Localization
by: Orvalho, Pedro, et al.
Published: (2024)

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

Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rules
by: Júnior, Antônio Carlos Souza Ferreira, et al.
Published: (2024)

Redundancy rules for MaxSAT
by: Bonacina, Ilario, et al.
Published: (2025)

AutoPBO: LLM-powered Optimization for Local Search PBO Solvers
by: Li, Jinyuan, et al.
Published: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

Resource-Constrained Heuristic for Max-SAT
by: Matejek, Brian, et al.
Published: (2024)

MaxSAT decoders for arbitrary CSS codes
by: Noormandipour, Mohammadreza, et al.
Published: (2024)

Decoding quantum color codes with MaxSAT
by: Berent, Lucas, et al.
Published: (2023)

AutoSAT: Automatically Optimize SAT Solvers via Large Language Models
by: Sun, Yiwen, et al.
Published: (2024)

MILP-SAT-GNN: Yet Another Neural SAT Solver
by: Cardillo, Franco Alberto, et al.
Published: (2025)

G-CSEA: A Graph-Based Conflict Set Extraction Algorithm for Identifying Infeasibility in Pseudo-Boolean Models
by: Garg, Kanishk, et al.
Published: (2025)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
by: Jha, Piyush, et al.
Published: (2024)

Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solver
by: Yu, Canhong, et al.
Published: (2026)

HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems
by: Chen, Qiyue, et al.
Published: (2025)

Extracting Problem Structure with LLMs for Optimized SAT Local Search
by: Schidler, André, et al.
Published: (2025)

Engineering an Exact Pseudo-Boolean Model Counter
by: Yang, Suwei, et al.
Published: (2023)

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

Pseudo-Boolean Proof Logging for Optimal Classical Planning
by: Dold, Simon, et al.
Published: (2025)

New Hybrid Heuristics for Pseudo-Boolean Propagation
by: Müßig, Mia, et al.
Published: (2025)

LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solvers
by: Wen, Junrui, et al.
Published: (2025)

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)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
by: Schwardt, J., 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)

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

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

CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention
by: Li, Han, et al.
Published: (2024)

Towards Projected and Incremental Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2024)

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

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