Propagation in CSP and SAT

DOI10.1007/11889205_12zbMATH Open1160.68542OpenAlexW1808305197MaRDI QIDQ3524239FDOQ3524239

Kostas Stergiou, Yannis Dimopoulos

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_12

Recommendations

• scientific article; zbMATH DE number 2080324
• A comparison between SAT and CSP techniques
• scientific article; zbMATH DE number 1759715
• scientific article; zbMATH DE number 2080331
• Representative encodings to translate finite CSPs into SAT

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• A comparison between SAT and CSP techniques
• GAC Via Unit Propagation
• Title not available (Why is that?)

This page was built for publication: Propagation in CSP and SAT

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