k-relevant Explanations for Constraint Programming
نویسندگان
چکیده
This paper presents a set of tools based on explanations for constraint programming. These tools exploit k-relevant explanations which enable us to use several explanations, which can sometimes leads to better diagnosis. k-relevant explanations are introduced and used to provide: diagnosis tools (state analysis, contradiction analysis, constraint impact analysis), interaction tools (dynamic constraint addition/retraction simulation), as well as improved search techniques.
منابع مشابه
Explications k-relevantes pour la programmation par contraintes
This paper presents a set of tools based on explanations for Constraint Programming. These tools exploit k-relevant explanations [Bay 96] which enable to use several explanations, which can lead to better diagnosis. k-relevant explanations are introduced and used to provide : diagnosis tools (state analysis, contradiction analysis, constraint impact analysis), and interaction tools (dynamic con...
متن کاملA Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کاملExplanations and Proof Trees
Introduction This paper proposes a model for explanations in a set theoretical framework using the notions of closure or fixpoint. In this approach, sets of rules associated with monotonic operators allow to define proof trees (Aczel 1977). The proof trees may be considered as a declarative view of the trace of a computation. We claim they are explanations of the result of a computation. First,...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملImplementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. Compared with other probabilistic versions of abductive logic programming, the approach is characterized by higher genera...
متن کامل