A CSP search algorithm with responsibility sets and kernels

DOI10.1007/s10601-007-9016-xzbMath1124.68022OpenAlexW2004424084MaRDI QIDQ2454814

Igor Razgon, Amnon Meisels

Publication date: 22 October 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-007-9016-x

zbMATH Keywords

KernelCSP search algorithmFC-RKPMAC-RKP

Mathematics Subject Classification ID

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

Related Items (1)

Concurrent forward bounding for distributed constraint optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetry breaking revisited
• An empirical study of phase transitions in binary constraint satisfaction problems
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: A CSP search algorithm with responsibility sets and kernels