Pseudo-polynomial functions over finite distributive lattices
Waldhauser, Tamás; Couceiro, Miguel (2011), Pseudo-polynomial functions over finite distributive lattices, in Weiru, Liu, Lecture Notes in Artificial Intelligence, Springer, p. 545-556
TypeCommunication / Conférence
External document linkhttp://arxiv.org/abs/1110.1811
Conference titleECSQARU 2011
Book titleLecture Notes in Artificial Intelligence
Book authorWeiru, Liu
MetadataShow full item record
Abstract (EN)In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial function over Y, and each uk is a map from Xk to Y. The resulting functions are referred to as pseudo-polynomial functions. We present an axiomatization for this class of pseudo-polynomial functions which differs from the previous ones both in flavour and nature, and develop general tools which are then used to obtain all possible such factorizations of a given pseudo-polynomial function.
Subjects / Keywordsdistributive lattice; factorization; pseudo-polynomial function; Sugeno utility function; Sugeno integral
Showing items related by title and author.
Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein Waldhauser, Tamás; Couceiro, Miguel (2013) Article accepté pour publication ou publié