首页>
外国专利>
SOLVING CONSTRAINT SATISFACTION PROBLEMS HAVING LOOSELY INTERCONNECTED SUB-PROBLEMS
SOLVING CONSTRAINT SATISFACTION PROBLEMS HAVING LOOSELY INTERCONNECTED SUB-PROBLEMS
展开▼
机译:解决具有松散关联的子问题的约束满意度问题
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method, apparatus and product. The method comprising automatically determining an abstract CSP based on a formally defined problem having interconnected sub-problems, wherein the abstract CSP corresponds to the problem, wherein the abstract CSP has a reduced complexity in comparison to a CSP representing the problem, wherein the abstract CSP captures the interconnection between the sub-problems and reduces the details of each sub-problem, wherein the abstract CSP comprises constraints over variables, wherein each variable having an associated domain; and repeatedly: (1) propagating constraints of the abstract CSP to reduce domains of the abstract CSP; (2) selecting a sub-problem to solve; (3) solving the sub-problem; and (4) updating the abstract CSP with values in accordance with the solution of the sub-problem. Whereby, a solution to the formally defined problem is determined based on the solutions to the sub-problems.
展开▼