2001/11/14 by Narendra Jussien, Jussien, Narendra, Samir Ouis +1 · 1 citation
Computer Science · Decision Sciences · #Constraint Satisfaction and Optimization #D.2.5 #D.2.6 #D.3.3 #F.4.1 #FOS: Computer and information sciences #Programming Languages (cs.PL) #Scheduling and Timetabling Solutions #Software Engineering (cs.SE) #cs.PL #cs.SE
paper · pdf · doi:10.48550/arxiv.cs/0111037
In A. Kusalik (ed), proceedings of the Eleventh International Workshop on Logic Programming Environments (WLPE'01), December 1, 2001, Paphos, Cyprus. cs.PL/0111042
openalex publication_date 2001/11/14 · arxiv created 2001/11/16 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we introduce a set of tools for providing user-friendly explanations in an explanation-based constraint programming system. The idea is to represent the constraints of a problem as an hierarchy (a tree). Users are then represented as a set of understandable nodes in that tree (a cut). Classical explanations (sets of system constraints) just need to get projected on that representation in order to be understandable by any user. We present here the main interests of this idea.