发明授权
- 专利标题: Solving constraint satisfaction problems having loosely interconnected sub-problems
- 专利标题(中): 解决具有松散互连子问题的约束满足问题
-
申请号: US13400141申请日: 2012-02-20
-
公开(公告)号: US08826075B2公开(公告)日: 2014-09-02
- 发明人: Yoav Katz , Michal Rimon , Avi Ziv
- 申请人: Yoav Katz , Michal Rimon , Avi Ziv
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 代理机构: Ziu Glazberg
- 主分类号: G06F11/00
- IPC分类号: G06F11/00
摘要:
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.
公开/授权文献
信息查询