Abstandshalter

Workshop Program


SUNDAY:
8:35-8:45Welcome (PC co-chairs Werner Kießling and Jim Delgrande)
8:45-10:00Session 1 "Modeling and Querying with CP-nets", session leader Jim Delgrande
Querying Databases with Incomplete CP-nets
Paolo Ciaccia (University of Bologna, Italy)
Hierarchical CP-networks
Denis Mindolin, Jan Chomicki (University at Buffalo, USA)
QuickLex (Sat): Hierarchical Lexicographic Bound Reduction for Propositional Satisfiability
Ulrich Junker (ILOG, France)
10:00-10:30Coffee break
10:30-11:15Session 2 "Invited talk", session leader Werner Kießling
Quantum Computing, Database Search and Preferences
William Mcready (D-Wave Systems Inc., Burnaby, Canada)
11:15-12:30Session 3 "Optimization of Pareto Preference Queries", session leader Parke Godfrey
The Hexagon Algorithm for Pareto Preference Queries
Timotheus Preisinger, Werner Kießling (University of Augsburg, Germany)
Consistently Adding Amalgamations to Preference Orders
Ulrich Güntzer (University of Tübingen, Germany), Wolf Balke (University of Hannover)
Link-based Ranking of Skyline Result Sets
Akrivi Vlachou, Michalis Vazirgiannis (Athens University of Economics and Business, Greece)
12:30-14:00Lunch
14:00-15:15Session 4 "Preferences and Logic Programming", session leader Patrick Bosc
Pre- and Post Preferences over Abductive Models
Luís Moniz Pereira, Gonçalo Lopes (Universidade Nova de Lisboa, Portugal), Pierangelo Dell'Acqua (Linköping University, Sweden)
Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions
Wolfgang Faber (University of Calabria, Italy), Hans Tompits, Stefan Woltran (Vienna University of Technology, Austria)
Using Preference Fusion for Default Reasoning
Gabriele Kern-Isberner, Manuela Ritterskamp (University of Dortmund, Germany)
15:20-16:35Session 5 "Models and Representations of Preferences", session leader Wolf Balke
Preference-Based Divisions to Overcome Empty Answers
Olivier Pivert, Patrick Bosc, Allel Hadjali (IRISA-ENSSAT, France)
Combining Qualitiative Preferences expressed by means of Generic Constraints
Souhila Kaci (CRIL, France), Henri Prade (IRIT, France)
Influence Diagrams with Partially Ordered Preferences
Daniel Kikuti, Fabio Cozman (University of São Paulo, Brasil)
16:35-17:00Coffee break
17:00-17:50Session 6 "Various Preference Optimization Issues", session leader Werner Kießling
Representing Interval Orders by Weighted Bases: some Complexity Results
Pierre Marquis, Meltem Öztürk (CRIL, Université d'Artois, France)
Tuning the top-k Update Process
Eftychia Baikousi, Panos Vassiliadis (University of Ioannina, Greece)
17:50-18:15Wrap up, announcements, discussions

Invited Talk


Quantum Computing, Databases and Preferences
William Macready, VP Product Development, D-Wave Systems Inc, Vancouver

The application of the laws of quantum mechanics to computational problems has revealed the promise of dramatic performance improvements. One of the earliest theoretical results was the ability to search an unstructured database of N items in sqrt(N) time. Today, great progress is being made in realizing quantum algorithms on real hardware. In this talk I will summarize recent progress, highlight the challenges that remain, and outline a proposal for how this new capability may be integrated into existing query languages with preference extensions.

Abstandshalter [disclaimer] [email] [printer friendly version]