Diller, M; Hunter, A; (2017) Encoding monotonic multiset preferences using ci-nets1. In: Mitschang, B and Ritter, N and Schwarz, H and Klettke, M and Thor, A and Kopp, O and Wieland, M, (eds.) Datenbanksysteme für Business, Technologie und Web (BTW 2017): Workshopband. (pp. pp. 169-180). German Infomatics Society: Stuttgart, Germany.

Preview

Text paper_web.pdf - Published Version Download (174kB) | Preview

Abstract

CP-nets and their variants constitute one of the main AI approaches for specifying and reasoning about preferences. CI-nets, in particular, are a CP-inspired formalism for representing ordinal preferences over sets of goods, which are typically monotonic. Considering also that goods often come in multisets rather than sets, a natural question is whether CI-nets can be used more or less directly to encode preferences over multisets. We here provide some initial ideas about this by Ąrst presenting a straight-forward generalisation of CI-nets to multisets with bounded multiplicities, which we show can be eiciently reduced to CI-nets. Second, we sketch a proposal for a further generalisation which allows for encoding preferences over multisets with unbounded multiplicities, yet characterise reasoning in this framework in terms of the Ąrst. We Ąnally show a potential use of our generalisation of CI-nets for personalization in a recent system for evidence aggregation.

Download activity - last month

Export as XMLCSVJSON

Download activity - last 12 months

Export as CSVXMLJSON

Downloads by country - last 12 months

Export as JSONXMLCSV

Archive Staff Only

View Item