All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Handling Possibly Conflicting Preferences

Result description

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.

Keywords

conflictingpreferencespreference languageRDM - relation data modeldatabase query

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Handling Possibly Conflicting Preferences

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the Third International Conference on Intelligent Human Computer Interaction IHCI 2011

  • ISBN

    978-3-642-31602-9

  • ISSN

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    207-219

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Prague

  • Event date

    Aug 29, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000312116400018

Result type

D - Article in proceedings

D

CEP

IN - Informatics

Year of implementation

2013