论文信息 - Transformations Between HCLP and PCSP

Transformations Between HCLP and PCSP

We present a general methodology for transforming between HCLP and PCSP in both directions. HCLP and PCSP each have advantages when modelling problems, and each have advantages when implementing models and solving them. Using the work presented in this paper, the appropriate paradigm can be used for each of these steps, with a meaning-preserving transformation in between if necessary. Michael Jampel has been funded by City University during his PhD, and is currently funded by the European Community under the TMR scheme. Jean-Marie Jacquet is supported by the Belgian National Fund for Scientific Research as a Research Associate. Part of this work was carried out in the context of the INTAS project 93-1702 "Efficient Symbolic Computing."

Jean-Marie Jacquet | David R. Gilbert | Sebastian Hunt | Michael Jampel

[1] Alan Borning,et al. Hierarchical Constraint Logic Programming , 1994, J. Log. Program..

[2] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.

[3] Michael J. Maher,et al. Constraint Hierarchies and Logic Programming , 1989, ICLP.

[4] Nicolas Beldiceanu,et al. Constraint Logic Programming , 1997 .

[5] Alan Borning,et al. Constraint hierarchies , 1992 .

[6] Joxan Jaffar,et al. Constraint logic programming , 1987, POPL '87.

[7] Eugene C. Freuder. Exploiting Structure in Constraint Satisfaction Problems , 1993, NATO ASI CP.

[8] Alan Borning,et al. Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison , 1989, NACLP.

[9] Francesca Rossi,et al. Constraint Solving over Semirings , 1995, IJCAI.

[10] Philippe Codognet,et al. An Incremental Hierarchical Constraint Solver , 1993, PPCP.

[11] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.