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 particular we propose a preference meta-model that defines an abstract 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.
CitationConfalonieri, R.; NIEVES, J. C.; Vazquez-Salceda, J. A preference meta-model for logic programs with possibilistic ordered disjunction. A: International Workshop Software Engineering for Answer Set Programming. "Second International Workshop Software Engineering for Answer Set Programming". Potsdam: CEUR Workshop Proceedings, 2009, p. 19-33.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com