We present a lattice-theoretic approach to version spaces in multicriteria preference learning and discuss some complexity aspects. In particular, we show that the description of version spaces in the preference model based on the Sugeno integral is an NP-hard problem, even for simple instances.