Imagen de Portada

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ye, Furong, Luo, Chuan, Cai, Shaowei
Formato:	Preprint
Publicado:	2024
Materias:	Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
por: Zheng, Jiongzhi, et al.
Publicado: (2024)

Enhancing Local Search for MaxSAT with Deep Differentiation Clause Weighting
por: Jiang, Menghua, et al.
Publicado: (2025)

Certified MaxSAT Preprocessing
por: Ihalainen, Hannes, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
por: Chen, Zhihan, et al.
Publicado: (2024)

Redundancy rules for MaxSAT
por: Bonacina, Ilario, et al.
Publicado: (2025)

Local Search for Integer Quadratic Programming
por: He, Xiang, et al.
Publicado: (2024)

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

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

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

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

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

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

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

OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach
por: Hu, Hao, et al.
Publicado: (2024)

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

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

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

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

Anytime Sequential Halving in Monte-Carlo Tree Search
por: Sagers, Dominic, et al.
Publicado: (2024)

A Generic Complete Anytime Beam Search for Optimal Decision Tree
por: Kiossou, Harold Silvère, et al.
Publicado: (2025)

Efficient SAT and MaxSAT techniques for solving the Two-Dimensional Strip Packing Problem
por: Kieu, Tuyen Van, et al.
Publicado: (2025)

SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning
por: Quenard, Gaspard, et al.
Publicado: (2024)

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

Anytime Single-Step MAPF Planning with Anytime PIBT
por: Gandotra, Nayesha, et al.
Publicado: (2025)

Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search
por: Arbelaez, Alejandro, et al.
Publicado: (2024)

Circuit-Aware SAT Solving: Guiding CDCL via Conditional Probabilities
por: Zhu, Jiaying, et al.
Publicado: (2025)

GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
por: Zhang, Zhanguang, et al.
Publicado: (2024)

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

Anytime Safe PAC Efficient Reasoning
por: Yu, Chengyao, et al.
Publicado: (2026)

A Geometric Perspective on the Difficulties of Learning GNN-based SAT Solvers
por: Skenderi, Geri
Publicado: (2025)

UNSAT Solver Synthesis via Monte Carlo Forest Search
por: Cameron, Chris, et al.
Publicado: (2022)