:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kondratiev, Victor, Gribanova, Irina, Semenov, Alexander
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2602.17130
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Recurrent CircuitSAT Sampling for Sequential Circuits
by: Ardakani, Arash, et al.
Published: (2025)

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

Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
by: Verel, Sébastien, et al.
Published: (2024)

HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
by: Li, Yang, et al.
Published: (2023)

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

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
by: Pan, Shuaiqun, et al.
Published: (2025)

A Parallel Approach to Counting Exact Covers Based on Decomposability Property
by: Fang, Liangda, et al.
Published: (2026)

Comparison of SAT-based and ASP-based Algorithms for Inconsistency Measurement
by: Kuhlmann, Isabelle, et al.
Published: (2023)

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

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

ParallelSearch: Train your LLMs to Decompose Query and Search Sub-queries in Parallel with Reinforcement Learning
by: Zhao, Shu, et al.
Published: (2025)

Asterisk*: Keep it Simple
by: Semenov, Andrew
Published: (2024)

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)

Certified MaxSAT Preprocessing
by: Ihalainen, Hannes, et al.
Published: (2024)

From monoliths to modules: Decomposing transducers for efficient world modelling
by: Boyd, Alexander, et al.
Published: (2025)

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

Solving Cyclic Antibandwidth Problem by SAT
by: Xuan, Hieu Truong, et al.
Published: (2026)

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

Scheduling Parallel Optical Circuit Switches for AI Training
by: Liang, Kevin, et al.
Published: (2026)

Orbitopal Fixing in SAT
by: Anders, Markus, et al.
Published: (2026)

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

High-Throughput SAT Sampling
by: Ardakani, Arash, et al.
Published: (2025)

Learning with Instance-Dependent Noisy Labels by Anchor Hallucination and Hard Sample Label Correction
by: Huang, Po-Hsuan, et al.
Published: (2024)

QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits
by: Tyagin, Ilya, et al.
Published: (2025)

W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs
by: Wen, Weihuang, et al.
Published: (2023)

Face Density as a Proxy for Data Complexity: Quantifying the Hardness of Instance Count
by: Mohammadi-Seif, Abolfazl, et al.
Published: (2026)

Cog-DRIFT: Exploration on Adaptively Reformulated Instances Enables Learning from Hard Reasoning Problems
by: Chen, Justin Chih-Yao, 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)

CNOT-Optimal Clifford Synthesis as SAT
by: Shaik, Irfansha, et al.
Published: (2025)

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

SAT-Based Bounded Fitting for the Description Logic ALC
by: Funk, Maurice, et al.
Published: (2025)

Revealing Algorithmic Deductive Circuits for Logical Reasoning
by: Nguyen, Phuong Minh, et al.
Published: (2026)

DELTA: Decomposed Efficient Long-Term Robot Task Planning using Large Language Models
by: Liu, Yuchen, et al.
Published: (2024)

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

Depth-Optimal Quantum Layout Synthesis as SAT
by: Jakobsen, Anna B., et al.
Published: (2025)

Neurons for Neutrons: A Transformer Model for Computation Load Estimation on Domain-Decomposed Neutron Transport Problems
by: Mote, Alexander, et al.
Published: (2024)

Dynamic Parallel Tree Search for Efficient LLM Reasoning
by: Ding, Yifu, et al.
Published: (2025)

PairVDN - Pair-wise Decomposed Value Functions
by: Buzzard, Zak
Published: (2025)

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