Volume

Dagstuhl Seminar Proceedings, Volume 4271

Publication Details

  • published at: 2006-01-19
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.04271.1
04271 Abstracts Collection – Preferences: Specification, Inference, Applications

Authors: Gianni Bosi, Ronen I. Brafman, Jan Chomicki, and Werner Kießling

Abstract
From 27.06.04 to 02.07.04, the Dagstuhl Seminar 04271 ``Preferences: Specification, Inference, Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Gianni Bosi, Ronen I. Brafman, Jan Chomicki, and Werner Kießling. 04271 Abstracts Collection – Preferences: Specification, Inference, Applications. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{bosi_et_al:DagSemProc.04271.1,
  author =	{Bosi, Gianni and Brafman, Ronen I. and Chomicki, Jan and Kie{\ss}ling, Werner},
  title =	{{04271 Abstracts Collection – Preferences: Specification, Inference, Applications}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.1},
  URN =		{urn:nbn:de:0030-drops-4510},
  doi =		{10.4230/DagSemProc.04271.1},
  annote =	{Keywords: Preference specification and representation, preference composition and merging, preference aggregation, xiomatic properties of preferences, logics of preference, topological/algebraic preference structures and their utility representation, inear and non-linear utility representations, preferences with intransitive indifference}
}
Document
DOI: 10.4230/DagSemProc.04271.2
Adaptive Rich Media Presentations via Preference-Based Constrained Optimization

Authors: Ronen I. Brafman and Doron Friedman

Abstract
Personalization and adaptation of multi-media messages are well known and well studied problems. Ideally, each message should reflect its recipient's interests, device capabilities, and network conditions. Such personalization is more difficult to carry out given a compound multi-media presentation containing multiple spatially and temporally related elements. This paper describes a novel formal, yet practical approach, and an implemented system prototype for authoring and adapting compound multi-media presentations. Our approach builds on recent advances in preference specification and preferences-based constrained optimization techniques.
Cite as

Ronen I. Brafman and Doron Friedman. Adaptive Rich Media Presentations via Preference-Based Constrained Optimization. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{brafman_et_al:DagSemProc.04271.2,
  author =	{Brafman, Ronen I. and Friedman, Doron},
  title =	{{Adaptive Rich Media Presentations via Preference-Based Constrained Optimization}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.2},
  URN =		{urn:nbn:de:0030-drops-4050},
  doi =		{10.4230/DagSemProc.04271.2},
  annote =	{Keywords: Preferences, cp-nets, multi-media presentations}
}
Document
DOI: 10.4230/DagSemProc.04271.3
Efficient Evaluation of Numerical Preferences: Top k Queries, Skylines and Multi-objective Retrieval

Authors: Wolf-Tilo Balke

Abstract
Query processing in databases and information systems has developed beyond mere SQL-style exact matching of attribute values. Scoring database objects according to numerical user preferences and retrieving only the top k matches or Pareto-optimal result sets (skyline queries) are already common for a variety of applications. Recently a lot of database literature has focussed on how to efficiently evaluate queries based on numerical preferences. Specialized algorithms using either top k retrieval (assuming a single compensation function defined over all query predicates, i.e. a global utility function) or computing skylines (assuming all query predicates as pairwise incomparable) have been shown to be capable of avoiding naïve linear database scans by pruning large numbers of database objects and thus vastly improve scalability. However, both paradigms are only two extreme cases of exploring viable compromises for each user’s objectives, which may or may not be comparable. To find the correct result set for arbitrary cases of multi-objective query processing in databases a novel algorithm for computing sets of objects that are non-dominated with respect to a set of monotonic objective functions representing a user's notion of utility, has recently been presented. Naturally containing top k and skyline retrieval paradigms as special cases, this algorithm maintains scalability also for all cases in between. To be more precise, in both special cases the multi-objective retrieval algorithm will behave exactly like the most efficient known evaluation algorithms for top k and skyline queries respectively. This algorithm has also been proved to be correct and instance-optimal in terms of necessary object accesses. Moreover, it improves the psychological response behavior by progressively producing result objects as quickly as possible, while the algorithm is still running, so user can deal with result objects at the earliest point in time. Our tutorial will discuss all state of the art algorithms for top k retrieval, skyline queries and multi-objective retrieval and point to open problems, future extensions of the paradigm and research in numerical preferences.
Cite as

Wolf-Tilo Balke. Efficient Evaluation of Numerical Preferences: Top k Queries, Skylines and Multi-objective Retrieval. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{balke:DagSemProc.04271.3,
  author =	{Balke, Wolf-Tilo},
  title =	{{Efficient Evaluation of Numerical Preferences: Top k Queries, Skylines and Multi-objective Retrieval}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.3},
  URN =		{urn:nbn:de:0030-drops-4007},
  doi =		{10.4230/DagSemProc.04271.3},
  annote =	{Keywords: Top k retrieval , skyline queries, multi-objective optimization, numerical preferences, utility functions}
}
Document
DOI: 10.4230/DagSemProc.04271.4
Non-Transitive Consumer Behavior

Authors: Susanne Fuchs-Seliger

Abstract
Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there could be cicles among those alternatives which are of less importance for the individual and which he or she would never choose if better ones are available. Moreover, one can show that the compensated demand function is continuous under very weak conditions, and because of this, Shephard’s lemma follows without assuming transitivity and completeness of the underlying preferences.
Cite as

Susanne Fuchs-Seliger. Non-Transitive Consumer Behavior. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{fuchsseliger:DagSemProc.04271.4,
  author =	{Fuchs-Seliger, Susanne},
  title =	{{Non-Transitive Consumer Behavior}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.4},
  URN =		{urn:nbn:de:0030-drops-4027},
  doi =		{10.4230/DagSemProc.04271.4},
  annote =	{Keywords: Rational choice, consumer behavior, competitive equilibrium}
}
Document
DOI: 10.4230/DagSemProc.04271.5
Personalization of Queries based on User Preferences

Authors: Georgia Koutrika and Yannis Ioannidis

Abstract
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The underlying idea is that different users may find different things relevant to a search due to different preferences. Essential ingredients of query personalization are: (a) a model for representing and storing preferences in user profiles, and (b) algorithms for the generation of personalized answers using stored preferences. Modeling the plethora of preference types is a challenge. In this paper, we present a preference model that combines expressivity and concision. In addition, we provide algorithms for the selection of preferences related to a query and the progressive generation of personalized results, which are ranked based on user interest.
Cite as

Georgia Koutrika and Yannis Ioannidis. Personalization of Queries based on User Preferences. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{koutrika_et_al:DagSemProc.04271.5,
  author =	{Koutrika, Georgia and Ioannidis, Yannis},
  title =	{{Personalization of Queries based on User Preferences}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--19},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.5},
  URN =		{urn:nbn:de:0030-drops-4039},
  doi =		{10.4230/DagSemProc.04271.5},
  annote =	{Keywords: Query personalization, user profiles, preferences}
}
Document
DOI: 10.4230/DagSemProc.04271.6
Preference Modelling

Authors: Meltem Öztürk, Alexis Tsoukias, and Philippe Vincke

Abstract
This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and obviously decision analysis. Our notation and some basic definitions, such as those of binary relation, properties and ordered sets, are presented at the beginning of the paper. We start by discussing different reasons for constructing a model or preference. We then go through a number of issues that influence the construction of preference models. Different formalisations besides classical logic such as fuzzy sets and non-classical logics become necessary. We then present different types of preference structures reflecting the behavior of a decision-maker: classical, extended and valued ones. It is relevant to have a numerical representation of preferences: functional representations, value functions. The concepts of thresholds and minimal representation are also introduced in this section. In section 7, we briefly explore the concept of deontic logic (logic of preference) and other formalisms associated with "compact representation of preferences" introduced for special purpoes. We end the paper with some concluding remarks.
Cite as

Meltem Öztürk, Alexis Tsoukias, and Philippe Vincke. Preference Modelling. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{ozturk_et_al:DagSemProc.04271.6,
  author =	{\"{O}zt\"{u}rk, Meltem and Tsoukias, Alexis and Vincke, Philippe},
  title =	{{Preference Modelling}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.6},
  URN =		{urn:nbn:de:0030-drops-4507},
  doi =		{10.4230/DagSemProc.04271.6},
  annote =	{Keywords: Preferences, Interval Orders, Hesitation, Logical formulation}
}
Document
DOI: 10.4230/DagSemProc.04271.7
Preference-based Problem Solving for Constraint Programming

Authors: Ulrich Junker

Abstract
Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization approaches compile those preferences into a single utility function and use it as the optimization objective when solving the problem, but neither explain why the resulting solution satisfies the original preferences, nor indicate the trade-offs made during problem solving. We argue that the whole problem solving process becomes more transparent and controllable for the user if it is based on the original preferences. We show how the original preferences can be used to control the problem solving process and how they can be used to explain the choice and the optimality of the detected solution. Based on this explanation, the user can refine the preference model, thus gaining full control over the problem solver.
Cite as

Ulrich Junker. Preference-based Problem Solving for Constraint Programming. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{junker:DagSemProc.04271.7,
  author =	{Junker, Ulrich},
  title =	{{Preference-based Problem Solving for Constraint Programming}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.7},
  URN =		{urn:nbn:de:0030-drops-3993},
  doi =		{10.4230/DagSemProc.04271.7},
  annote =	{Keywords: Multi-criteria optimization, preferences, explanations}
}
Document
DOI: 10.4230/DagSemProc.04271.8
Preferences on Intervals: a general framework

Authors: Alexis Tsoukias and Meltem Öztürk

Abstract
I present a general framework for the comparison of alternatives to which (possibly) an interval of values is associated. Some representation theorems for the existence of the intervals are discussed as well the possibility ot explicitly take into account situations of hesitation. Some appropriate logical formalisms are discussed for such a purpose.
Cite as

Alexis Tsoukias and Meltem Öztürk. Preferences on Intervals: a general framework. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{tsoukias_et_al:DagSemProc.04271.8,
  author =	{Tsoukias, Alexis and \"{O}zt\"{u}rk, Meltem},
  title =	{{Preferences on Intervals: a general framework}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.8},
  URN =		{urn:nbn:de:0030-drops-4015},
  doi =		{10.4230/DagSemProc.04271.8},
  annote =	{Keywords: Preferences, Interval Orders, Hesitation, Logical formulation}
}
Document
DOI: 10.4230/DagSemProc.04271.9
Representing preferences in the possibilistic setting

Authors: Souhila Kaci, Didier Dubois, and Henri Prade

Abstract
The accurate and easy representation of users' preferences in information engineering systems becomes an important issue. Possibility theory provides a generic framework for the qualitative representation of preferences, where several equivalent information formats co- exist (distribution, logical bases, conditionals, graphical networks). Moreover, a bipolar representation distinguishing between positive and negative preferences has been developed in this setting. The paper offers a comprehensive survey of these representation issues.
Cite as

Souhila Kaci, Didier Dubois, and Henri Prade. Representing preferences in the possibilistic setting. In Preferences: Specification, Inference, Applications. Dagstuhl Seminar Proceedings, Volume 4271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{souhilakaci_et_al:DagSemProc.04271.9,
  author =	{Souhila Kaci and Dubois, Didier and Prade, Henri},
  title =	{{Representing preferences in the possibilistic setting}},
  booktitle =	{Preferences: Specification, Inference, Applications},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4271},
  editor =	{Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kie{\ss}ling},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.9},
  URN =		{urn:nbn:de:0030-drops-4063},
  doi =		{10.4230/DagSemProc.04271.9},
  annote =	{Keywords: Possibility, preference, possibilistic logic}
}

Filters

  • Authors
  • B
  • Balke, Wolf-Tilo
  • Bosi, Gianni
  • Brafman, Ronen I.
  • C
  • Chomicki, Jan
  • D
  • Dubois, Didier
  • F
  • Friedman, Doron
  • Fuchs-Seliger, Susanne
  • I
  • Ioannidis, Yannis
  • J
  • Junker, Ulrich
  • K
  • Kießling, Werner
  • Koutrika, Georgia
  • O
  • Öztürk, Meltem
  • P
  • Prade, Henri
  • S
  • Souhila Kaci
  • T
  • Tsoukias, Alexis
  • V
  • Vincke, Philippe

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact