Preference Handling in Relational Query Languages

0371584 - ÚI 2012 RIV US eng C - Conference Paper (international conference)
Nedbal, Radim
Preference Handling in Relational Query Languages.
Application of Information and Communication Technologies. Los Alamitos: IEEE Computer Society, 2011, s. 1-7. ISBN 978-1-61284-831-0.
[AICT 2011. International Conference on Application of Information and Communication Technologies/5./. Baku (AZ), 12.10.2011-14.10.2011]
Institutional research plan: CEZ:AV0Z10300504
Keywords : conflicting preferences * comparative preference statements * various kinds of preferences
Subject RIV: IN - Informatics, Computer Science

The need for handling preferences in relational query languages arises naturally in real-world applications that deal 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. Being based purely on the qualitative type of information about the preference model, the language supports encoding intuitive statements about preferences and having constructs for various kinds of preferences, the language 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/0205066