Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
作者： Chris Houghton , David Cohen
DOI: 10.1007/11564751_89
关键词:
摘要: Constraint Satisfaction Problem instances (CSPs) are a natural way to model real life problems such as image processing, scheduling and language understanding. In this paper we concerned with the modeling of CSPs how can affect performance different solution algorithms. particular interested in subquadrangles.
springer.com
researchgate.net 
sci-hub.st 参考文章(2)
Ugo Montanari, Networks of constraints: Fundamental properties and applications to picture processing Information Sciences. ,vol. 7, pp. 95- 132 ,(1974) , 10.1016/0020-0255(74)90008-5
Peter van Beek, Reasoning about qualitative temporal information Artificial Intelligence. ,vol. 58, pp. 297- 326 ,(1992) , 10.1016/0004-3702(92)90011-L