Language of Preference Formulae

0375475 - ÚI 2012 RIV CZ eng C - Conference Paper (international conference)
Nedbal, Radim
Language of Preference Formulae.
SOFSEM 2012: Theory and Practice of Computer Science. Vol. 2. Prague: Institute of Computer Science AS CR, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Špánek, R.; Turán, G.), s. 75-86. ISBN 978-80-87136-13-3.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
Institutional research plan: CEZ:AV0Z10300504
Keywords : conflicting preferences * relational 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. Being based purely on the qualitative type of information about the preference model, the language is intuitive and leads to a exible 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/0208118