Pseudo-polynomial functions over finite distributive lattices

From MaRDI portal
Publication:3011973

DOI10.1007/978-3-642-22152-1_46zbMATH Open1341.68246arXiv1110.1811OpenAlexW1975725257MaRDI QIDQ3011973FDOQ3011973


Authors: Miguel Couceiro, Tamás Waldhauser Edit this on Wikidata


Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1110.1811




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Pseudo-polynomial functions over finite distributive lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011973)