Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems

Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artificial intelligence, from planning to natural language understanding. A new method is proposed for decomposing constraint satisfaction problems using inferred disjunctive constraints. The decomposition reduces the size of the problem. Some solutions may be lost in the process, but not all. The decomposition supports an algorithm that exhibits superior performance. Analytical and experimental evidence suggests that the algorithm can take advantage of local weak spots in globally hard problems.

• Type: Conference
• Year: 1993
• Where: IJCAI
• Authors: Eugene C. Freuder, Paul D. Hubbe
• Keywords: Constraint Satisfaction Problems, IJCAI 1993, IJCAI 2007, Inferred Disjunctive Constraints, Problem Variables