Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....An abstracted framework is presented in terms of transformations of CSLD trees. In this approach, the constraint(s) to suppress are selected by the user but not automatically detected by the system. The Constraint Relaxation problem can also be studied as the handling of a tower of constraints [3, 13]. For example, the HCLP(R) system considers that the whole problem does not have any solution. Therefore it tries to find a solution respecting only the required constraints, and then refines the solution adding the preferred constraints level 2 by level until failure. Unfortunately, this ....

Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.

....of the chosen constraint. 6.2 Former answers As far as we know, no system is able to efficiently answer all the questions we raised above. In the literature, we identified two systems which fully answered the three questions but they were too simple for the kind of problems we want to solve [9, 33]. The others only answer one or two questions. In in [19, 35] the who is answered using responsibility between constraint or between variables to determine a good constraint to relax. In [19] the when ins asnwered using global consistency techniques. Nevertheless, those systems show good ways of ....

Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC