Thumbnail - No thumbnail

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

Type
Communication / Conférence
External document link
http://arxiv.org/abs/1110.1811
Date
2011
Conference title
ECSQARU 2011
Conference date
2011-06
Conference city
Belfast
Conference country
Royaume-Uni
Book title
Lecture Notes in Artificial Intelligence
Book author
Weiru, Liu
Publisher
Springer
ISBN
978-3-642-22151-4
Pages
545-556
Metadata
Show full item record
Author(s)
Waldhauser, Tamás
Couceiro, Miguel
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 / Keywords
distributive lattice; factorization; pseudo-polynomial function; Sugeno utility function; Sugeno integral