Handling Possibly Conflicting Preferences

0365405 - ÚI 2013 RIV DE eng C - Conference Paper (international conference)
Nedbal, Radim
Handling Possibly Conflicting Preferences.
Proceedings of the Third International Conference on Intelligent Human Computer Interaction IHCI 2011. Heidelberg: Springer, 2013 - (Kudělka, M.; Pokorný, J.; Snášel, V.; Abraham, A.), s. 207-219. Advances in Intelligent Systems and Computing, 179. ISBN 978-3-642-31602-9. ISSN 2194-5357.
[IHCI 2011. International Conference on Intelligent Human Computer Interaction /3./. Prague (CZ), 29.08.2011-31.08.2011]
R&D Projects: GA ČR GAP202/10/0761
Institutional research plan: CEZ:AV0Z10300504
Keywords : conflicting * preferences * preference language * RDM - relation data model * database query
Subject RIV: IN - Informatics, Computer Science

There is a need for handling preferences in relational query languages that arises naturally in real-world applications dealing with possible choices generated by the current state of the world captured in the relational data model. To address this problem, we propose a fully declarative language for encoding preferences conditional on the current state of the world represented as a relation database instance. The language has constructs for various kinds of preferences, and we show how to interpret (sets of) its formulae; even sets of formulae that encode conflicting preferences. This leads to a flexible approach for specifying the most desirable choices of autonomous systems that act on behalf of their designers. Throughout the paper, we use an example of a control support system for a bank surveillance to motivate the need for our framework and to illustrate it.
Permanent Link: http://hdl.handle.net/11104/0200653