Invention Grant
- Patent Title: Solving constraint satisfaction problems having loosely interconnected sub-problems
- Patent Title (中): 解决具有松散互连子问题的约束满足问题
-
Application No.: US13400141Application Date: 2012-02-20
-
Publication No.: US08826075B2Publication Date: 2014-09-02
- Inventor: Yoav Katz , Michal Rimon , Avi Ziv
- Applicant: Yoav Katz , Michal Rimon , Avi Ziv
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Ziu Glazberg
- Main IPC: G06F11/00
- IPC: G06F11/00

Abstract:
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.
Public/Granted literature
- US20130219215A1 SOLVING CONSTRAINT SATISFACTION PROBLEMS HAVING LOOSELY INTERCONNECTED SUB-PROBLEMS Public/Granted day:2013-08-22
Information query