Solving non-binary CSPs using the hidden variable encoding

DOI10.1007/3-540-45578-7_12MaRDI QIDQ4475629zbMATH OpenFDO

Authors Kostas Stergiou, Nikos Mamoulis

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390168.htm

Mathematics Subject Classification ID

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

Recommendations

• Methods and Applications of Artificial Intelligence
• scientific article; zbMATH DE number 2243409
• Binary vs. non-binary constraints
• On dual encodings for non-binary constraint satisfaction problems
• On forward checking for non-binary constraint satisfaction

Cited in

(10)

• Comparing the notions of optimality in CP-nets, strategic games and soft constraints
• Binary vs. non-binary constraints
• Partition search for non-binary constraint satisfaction
• Domain filtering consistencies for non-binary constraints
• Open constraint programming
• On dual encodings for non-binary constraint satisfaction problems
• An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm
• A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
• Methods and Applications of Artificial Intelligence
• scientific article; zbMATH DE number 2243409 (Why is no real title available?)

This page was built for publication: Solving non-binary CSPs using the hidden variable encoding

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