On the dynamic detection of interchangeability in finite constraint satisfaction problems

DOI10.1007/3-540-45578-7_61MaRDI QIDQ4475689zbMATH OpenFDO

Authors Amy M. Beckwith, Berthe Y. Choueiry

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/22390760.htm

Mathematics Subject Classification ID

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

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• How the level of interchangeability embedded in a finite constraint satisfaction problem affects the performance of search
• Dynamic structural symmetry breaking for constraint satisfaction problems
• Directional Interchangeability for Enhancing CSP Solving
• Symmetry Definitions for Constraint Satisfaction Problems

Cited in

(5)

• Solving quantified constraint satisfaction problems
• Soft interchangeability for case adaptation
• Directional Interchangeability for Enhancing CSP Solving
• How the level of interchangeability embedded in a finite constraint satisfaction problem affects the performance of search
• Exploiting the CSP structure by interchangeability

This page was built for publication: On the dynamic detection of interchangeability in finite constraint satisfaction problems

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