Representative explanations for over-constrained problems

  • Authors:
  • Barry O'Sullivan;Alexandre Papadopoulos;Boi Faltings;Pearl Pu

  • Affiliations:
  • Cork Constraint Computation Centre, University College Cork, Ireland;Cork Constraint Computation Centre, University College Cork, Ireland;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

  • Venue:
  • AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In many interactive decision making scenarios there is often no solution that satisfies all of the user's preferences. The decision process can be helped by providing explanations. Relaxation show sets of consistent preferences and, thus, indicate Which preferences can be enforced, while exclusion sets show which preferences can be relaxed to obtain a solution. We propose a new approach to explanation based on the notion of a representative set of explanations. The size of the set of explanations we compute is exponentially more compact than that found using common approaches from the literature based on finding all minimal conflicts.