کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6853158 658310 2016 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems
ترجمه فارسی عنوان
مثلث شکسته: از ارزش ادغام شده به یک طبقه قابل قبول از مشکلات رضایتمندی محدودیت عمومی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
A binary CSP instance satisfying the broken-triangle property (BTP) can be solved in polynomial time. Unfortunately, in practice, few instances satisfy the BTP. We show that a local version of the BTP allows the merging of domain values in arbitrary instances of binary CSP, thus providing a novel polynomial-time reduction operation. Extensive experimental trials on benchmark instances demonstrate a significant decrease in instance size for certain classes of problems. We show that BTP-merging can be generalised to instances with constraints of arbitrary arity and we investigate the theoretical relationship with resolution in SAT. A directional version of general-arity BTP-merging then allows us to extend the BTP tractable class previously defined only for binary CSP. We investigate the complexity of several related problems including the recognition problem for the general-arity BTP class when the variable order is unknown, finding an optimal order in which to apply BTP merges and detecting BTP-merges in the presence of global constraints such as AllDifferent.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 234, May 2016, Pages 196-218
نویسندگان
, , , , , ,