Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction

نویسندگان

  • Eugene C. Freuder
  • Daniel Sabin
چکیده

Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for this abstraction process. Multi-dimensional problems may involve vectors of values , or conjunctive constraints. Utilizing the in-terchangeability can permit more eecient solutions of the abstracted problem. These solutions can be expanded into smaller reformulations of the original problem. Solving abstracted and then reformulated problems can be considerably more eecient than solving the original problems. We provide data that demonstrates the potential of this abstraction/reformulation process for multi-dimensional problems, and illuminates how its utility can depend on natural problem parameters .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

for Multi - Dimensional Constraint Satisfaction

Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for ...

متن کامل

Exploiting the Structure of Constraint Satisfaction Problems by Interchangeability

Till now days there are methods for abstraction and reformulation of CSPs which facilitate easier and faster solving of CSPs [1] but there are not yet methods for organising and structuring the solution space. The thesis work proposed here is primely motivated by the need for an method for classifying and structuring the solutions of CSPs. Classical enumerative methods are deficient in organisi...

متن کامل

A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game

In this paper we describe a reformulation strategy for solving multi-dimensional Constraint Satisfaction Problems (CSPs). This strategy operates by iteratively considering, in isolation, each one of the uni-dimensional constraints in the problem. It exploits the approximate symmetries identified on the domain values in order to enforce the selected constraint on the simplified problem. This pap...

متن کامل

A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SC Set Game

In this paper we describe a reformulation strategy for solving multi-dimensional Constraint Satisfaction Problems (CSPs). This strategy operates by iteratively considering, in isolation, each one of the uni-dimensional constraints in the problem. It exploits the approximate symmetries identified on the domain values in order to enforce the selected constraint on the simplified problem. This pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997