Modular lazy search for constraint satisfaction problems Export

@misc{citeulike:1523819, abstract = {We describe a unified, lazy, declarative framework for solving constraint satisfaction problems, an important subclass of combinatorial search problems. These problems are both practically significant and computationally hard. Finding solutions involves combining good general-purpose search algorithms with problem-specific heuristics. Conventional imperative algorithms are usually implemented and presented monolithically, which makes them hard to understand and reuse, even though new algorithms ...}, author = {Nordin, T. and Tolmach, A.}, citeulike-article-id = {1523819}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5440}, keywords = {constraint-satisfaction, lazy-evaluation}, posted-at = {2007-07-31 06:39:09}, priority = {2}, title = {Modular lazy search for constraint satisfaction problems}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5440}, year = {2001} }

TY - GEN ID - citeulike:1523819 L3 - citeulike-article-id:1523819 N2 - We describe a unified, lazy, declarative framework for solving constraint satisfaction problems, an important subclass of combinatorial search problems. These problems are both practically significant and computationally hard. Finding solutions involves combining good general-purpose search algorithms with problem-specific heuristics. Conventional imperative algorithms are usually implemented and presented monolithically, which makes them hard to understand and reuse, even though new algorithms ... TI - Modular lazy search for constraint satisfaction problems KW - constraint-satisfaction KW - lazy-evaluation AU - Nordin, T AU - Tolmach, A PY - 2001/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5440 ER -