Imagen de Portada

Deciding the Satisfiability of Combined Qualitative Constraint Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cohen-Solal, Quentin, Niveau, Alexandre, Bouzid, Maroua
Formato:	Preprint
Publicado:	2026
Materias:	Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Minimax Strikes Back
por: Cohen-Solal, Quentin, et al.
Publicado: (2020)

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

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

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

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

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

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

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

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

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

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

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

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

Boolean Satisfiability via Imitation Learning
por: Zhang, Zewei, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Learning When Not to Decide: A Framework for Overcoming Factual Presumptuousness in AI Adjudication
por: Afane, Mohamed, et al.
Publicado: (2026)

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

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