کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
438262 690246 2008 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The expressive power of valued constraints: Hierarchies and collapses
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The expressive power of valued constraints: Hierarchies and collapses
چکیده انگلیسی

In this paper, we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases, a large class of valued constraints, of all possible arities, can be expressed by using valued constraints over the same domain of a fixed finite arity. We also show that some simple classes of valued constraints, including the set of all monotonic valued constraints with finite cost values, cannot be expressed by a subset of any fixed finite arity, and hence form an infinite hierarchy.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 409, Issue 1, 6 December 2008, Pages 137-153