Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key requirement is the presence of an aggregator operator for combining preferences. Given a residuated monoid of preferences, the paper first shows how to build a new residuated monoid of (possibly infinite) tuples, which is based on the lexicographic order. Second, it introduces a variant of an approximation technique (known as Mini-bucket) that exploits the presence of the weak inverse.
翻译:残留理论涉及对部分定序代数结构的研究,这些结构往往是单体结构,为单体操作者配备了微弱的反面,其应用领域之一是制约性编程,其主要要求是存在组合优惠的聚合体操作者。 鉴于重获单一的偏好,本文首先展示了如何建立一个新的(可能无限的)重生单体软骨结构,该结构以法系顺序为基础。 其次,它引入了一种利用弱体反面存在的近似技术(称为Mini-bucket)的变体。