We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semantics of a large family of substructural and fuzzy logics [13,15], and are therefore natural candidates for this role. As a preliminary evidence in support to our claim, along the lines of Cooper et al. and Larrosa et al. [11,18], we describe a polynomial-time algorithm that enforces k-hyperarc consistency on soft CSPs evaluated over DRLs. Observed that, in general, DRLs are neither idempotent nor totally ordered, this algorithm accounts as a generalization of available enforcing algorithms over commutative idempotent semirings and fair valuation structures [4,11]. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Bova, S. (2009). Soft constraints processing over divisible residuated lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 887–898). https://doi.org/10.1007/978-3-642-02906-6_76
Mendeley helps you to discover research relevant for your work.