Accepted papers

• Paolo Ciaccia:
  Querying Databases with Incomplete CP-nets
• Denis Mindolin, Jan Chomicki:
  Hierarchical CP-networks
• Yannis Dimpopoulos, Fani Athienitou:
  Learning CP-Networks: A preliminary investigation
• Timotheus Preisinger, Werner Kießling:
  The Hexagon Algorithm for Pareto Preference Queries
• Ulrich Güntzer, Wolf Balke:
  Consistently Adding Amalgamations to Preference Orders
• Akrivi Vlachou, Michalis Vazirgiannis:
  Link-based Ranking of Skyline Result Sets
• Luís Moniz Pereira, Gonçalo Lopes, Pierangelo Dell'Acqua:
  Pre- and Post Preferences over Abductive Models
• Wolfgang Faber, Hans Tompits, Stefan Woltran:
  Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions
• Gabriele Kern-Isberner, Manuela Ritterskamp:
  Using Preference Fusion for Default Reasoning
• Olivier Pivert, Patrick Bosc, Allel Hadjali:
  Preference-Based Divisions to Overcome Empty Answers
• Souhila Kaci, Henri Prade:
  Combining Qualitiative Preferences expressed by means of Generic Constraints
• Daniel Kikuti, Fabio Cozman:
  Influence Diagrams with Partially Ordered Preferences
• Pierre Marquis, Meltem Ozturk:
  Representing Interval Orders by Weighted Bases: some Complexity Results
• Eftychia Baikousi, Panos Vassiliadis:
  Tuning the top-k Update Process
• Ulrich Junker:
  QuickLex (Sat): Hierarchical Lexicographical Bound Reduction for Propositional Satisfiability