Interleaved Alldifferent Constraints: CSP vs. SAT Approaches

DOI10.1007/978-3-540-85776-1_34zbMath1169.68606OpenAlexW1570788711MaRDI QIDQ3534667

Frédéric Saubion, Eric Monfroy, Frédéric Lardeux

Publication date: 4 November 2008

Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_34

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Principles of Constraint Programming

This page was built for publication: Interleaved Alldifferent Constraints: CSP vs. SAT Approaches