Exploiting entropy in constraint programming

DOI10.1007/978-3-031-33271-5_21MaRDI QIDQ6080978zbMATH OpenOpenAlexFDO

Authors Auguste Burlats, Gilles Pesant

Publication date 4 October 2023

Published in Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-33271-5_21

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cites work

• A Mathematical Theory of Communication
• Accelerating counting-based search
• From support propagation to belief propagation in constraint programming
• MiniCP: a lightweight solver for constraint programming
• Principles and Practice of Constraint Programming – CP 2004
• Solution sampling with random table constraints

Cited in

(2)

• Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
• Shaping reward signals in reinforcement learning using constraint programming

This page was built for publication: Exploiting entropy in constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080978)