A preference meta-model for logic programs with possibilistic ordered disjunction

Roberto Confalonieri, Juan Carlos Nieves Sánchez, Javier Vázquez-Salceda · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · 2009

Abstract This paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Driven Methodology (MDM). MDM allows to specify problem domains by means of meta-models which can be converted to instance models or other meta-models through transformation functions. In preference specification language allowing users to specify preferences in a more friendly way using models. We also present a meta-model for logic programs with possibilistic order disjunction. Then we show how we conceptually map the preference meta-model to logic programs with possibilistic ordered disjunction by means of a mapping function. 1

Read the paper · More papers on PaperTik