| M. Jampel, J-M. Jacquet, D. Gilbert, and S. Hunt. Transformations between HCLP and PCSP. In Proc. CP'96: Intl. Conf. on Principles and Practice of Constraint Programming. Springer, 1995. LNCS. |
....optimization cannot be precisely simulated in HCLP [40] PLP is a more expressive paradigm for problems requiring optimization and relaxation. Recently, Jampel showed that there is a direct correspondence between the constraint hierarchies of HCLP and partial constraint satisfaction problems [20]. We have also examined the application of the notion of preference in the area of deductive databases [14] but we do not go into these details here for the sake of brevity. Traditional database query languages allow the user to express only the mandatory requirements on the data to be retrieved ....
M. Jampel, J-M. Jacquet, D. Gilbert, and S. Hunt. Transformations between HCLP and PCSP. In Proc. CP'96: Intl. Conf. on Principles and Practice of Constraint Programming. Springer, 1995. LNCS.
.... problems that are impossible or impractical to solve, and also presented algorithms searching for approximate solutions by weakening CSPs over finite domains [23, 24] Jampel provided a formal method for transformations between constraint hierarchies and partial constraint satisfaction problems [51]. Chapter 8 Conclusion and Future Work This chapter concludes the dissertation and provides future directions. 8.1 Conclusion In this dissertation, we discussed properties and satisfaction of hierarchical constraint systems (HCSs) from the viewpoint of local propagation. Basically, local ....
Jampel, M., J.-M. Jacquet, D. Gilbert, and S. Hunt, "Transformations between HCLP and PCSP," in Principles and Practice of Constraint Programming---CP'96 (E. C. Freuder, ed.), vol. 1118 of Lecture Notes in Computer Science, Springer-Verlag, Aug. 1996, pp. 252--266.
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