JULY 27, 2004
This presentation of the article QuickXplain: Preferred Explanations and Relaxations for Over-Constrained Problems has been given at the Nineteenth National Conference on Artificial Intelligence AAAI 2004. It shows how to compute lexicographically preferred and thus minimal inconsistent subsets of an over-constrained problem by recursive problem decomposition. ►
This web site expresses personal reflections about scientific topics with the purpose of contributing to discussions in scientific communities. As such, this content is not related to any organization, association, or employment.