Exploiting the CSP structure by interchangeability

DOI10.1007/3-540-45578-7_75MaRDI QIDQ4475706zbMATH OpenFDO

Authors N. Neagu

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

zbMATH Keywords

constraint satisfaction probleminterchangeability

Mathematics Subject Classification ID

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

Recommendations

• On the dynamic detection of interchangeability in finite constraint satisfaction problems
• scientific article; zbMATH DE number 1322790
• A Novel Approach For Detecting Symmetries in CSP Models
• A new approach to partial constraint satisfaction problems
• Directional Interchangeability for Enhancing CSP Solving

Cited in

(2)

• Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B
• A CSP abstraction framework

This page was built for publication: Exploiting the CSP structure by interchangeability

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