:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cohen-Solal, Quentin, Niveau, Alexandre, Bouzid, Maroua
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2602.08848
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Completeness of Unbounded Best-First Minimax and Descent Minimax
by: Cohen-Solal, Quentin
Published: (2026)

Learning to Play Two-Player Perfect-Information Games without Knowledge
by: Cohen-Solal, Quentin
Published: (2020)

Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
by: Cohen-Solal, Quentin
Published: (2026)

Study and improvement of search algorithms in two-players perfect information games
by: Cohen-Solal, Quentin
Published: (2025)

Minibal: Balanced Game-Playing Without Opponent Modeling
by: Cohen-Solal, Quentin, et al.
Published: (2026)

Minimax Strikes Back
by: Cohen-Solal, Quentin, et al.
Published: (2020)

On some improvements to Unbounded Minimax
by: Cohen-Solal, Quentin, et al.
Published: (2025)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Combining Constraint Programming Reasoning with Large Language Model Predictions
by: Régin, Florian, et al.
Published: (2024)

LinSATNet: The Positive Linear Satisfiability Neural Networks
by: Wang, Runzhong, et al.
Published: (2024)

IB-Net: Initial Branch Network for Variable Decision in Boolean Satisfiability
by: Chan, Tsz Ho, et al.
Published: (2024)

Attention Satisfies: A Constraint-Satisfaction Lens on Factual Errors of Language Models
by: Yuksekgonul, Mert, et al.
Published: (2023)

Mitigating the reconstruction-detection trade-off in VAE-based unsupervised anomaly detection
by: Senellart, Agathe, et al.
Published: (2026)

Neurosymbolic Language Reasoning as Satisfiability Modulo Theory
by: Oh, Hyunseok, et al.
Published: (2026)

Integer Linear Programming Preprocessing for Maximum Satisfiability
by: Zhang, Jialu, et al.
Published: (2025)

On the Expressive Power of GNNs for Boolean Satisfiability
by: Peltonen, Saku, et al.
Published: (2026)

Boolean Satisfiability via Imitation Learning
by: Zhang, Zewei, et al.
Published: (2025)

Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability
by: Jabs, Christoph, et al.
Published: (2025)

Satisfiability Modulo Theory Meets Inductive Logic Programming
by: Upreti, Nijesh, et al.
Published: (2025)

On the Size Complexity and Decidability of First-Order Progression
by: Classen, Jens, et al.
Published: (2026)

Randomness control and reproducibility study of random forest algorithm in R and Python
by: Camadini, Louisa, et al.
Published: (2024)

Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy
by: Ganian, Robert, et al.
Published: (2025)

Continuous Optimization for Satisfiability Modulo Theories on Linear Real Arithmetic
by: Cen, Yunuo, et al.
Published: (2026)

Optimizing Ethical Risk Reduction for Medical Intelligent Systems with Constraint Programming
by: Brayé, Clotilde, et al.
Published: (2025)

From Subsumption to Satisfiability: LLM-Assisted Active Learning for OWL Ontologies
by: Zhao, Haoruo, et al.
Published: (2026)

torchmSAT: A GPU-Accelerated Approximation To The Maximum Satisfiability Problem
by: Hosny, Abdelrahman, et al.
Published: (2024)

Scalable Floating-Point Satisfiability via Staged Optimization
by: Zhang, Yuanzhuo, et al.
Published: (2026)

The AI Definition and a Program Which Satisfies this Definition
by: Dobrev, Dimiter
Published: (2022)

Probabilistic and Causal Satisfiability: Constraining the Model
by: Bläser, Markus, et al.
Published: (2025)

Deciding When Not to Decide: Indeterminacy-Aware Intrusion Detection with NeutroSENSE
by: Al-Masri, Eyhab
Published: (2025)

GLinSAT: The General Linear Satisfiability Neural Network Layer By Accelerated Gradient Descent
by: Zeng, Hongtai, et al.
Published: (2024)

Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration
by: Sebastiani, Roberto
Published: (2025)

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
by: Li, Jinzhao, et al.
Published: (2025)

Tracking vs. Deciding: The Dual-Capability Bottleneck in Searchless Chess Transformers
by: Li, Quanhao, et al.
Published: (2026)

Learning to Decide with Just Enough: Information-Theoretic Context Summarization for CMDPs
by: Liu, Peidong, et al.
Published: (2025)

Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning
by: Bessa, Swann, et al.
Published: (2024)

How Hard is it to Decide if a Fact is Relevant to a Query?
by: Bienvenu, Meghyn, et al.
Published: (2026)

CP-SynC: Multi-Agent Zero-Shot Constraint Modeling in MiniZinc with Synthesized Checkers
by: Song, Yuliang, et al.
Published: (2026)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
by: Dörfler, Julian, et al.
Published: (2024)

GeoDecider: A Coarse-to-Fine Agentic Workflow for Explainable Lithology Classification
by: Wang, Jiahao, et al.
Published: (2026)