Fundamental properties of neighbourhood substitution in constraint satisfaction problems

DOI10.1016/S0004-3702(96)00018-5zbMath1017.68534WikidataQ127725603 ScholiaQ127725603MaRDI QIDQ1402745

Martin C. Cooper

Publication date: 28 August 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (6)

Reduction operations in fuzzy or valued constraint satisfaction ⋮ Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination ⋮ Linear constraints for the interpretation of line drawings of curved objects ⋮ Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns ⋮ Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems

Cites Work

• Comments on Mohr and Henderson's path consistency algorithm
• An optimal k-consistency algorithm
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Synthesizing constraint expressions

This page was built for publication: Fundamental properties of neighbourhood substitution in constraint satisfaction problems