A Constraint Directed Model for Partial Constraint Satisfaction Problems
暂无分享,去创建一个
[1] Byungki Cha,et al. Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.
[2] Peter van Beek,et al. On the conversion between non-binary constraint satisfaction problems , 1998, AAAI 1998.
[3] Peter van Beek,et al. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.
[4] Wanlin Pang,et al. Constraint-Directed Backtracking , 1997, Australian Joint Conference on Artificial Intelligence.
[5] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[6] Eugene C. Freuder,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[7] Wolfgang Bibel,et al. Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..
[8] Wanlin Pang,et al. Characterizing Tractable CSPs , 1998, Canadian Conference on AI.
[9] Edward P. K. Tsang,et al. Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..
[10] Wanlin Pang,et al. Constraint structure in constraint satisfaction problems , 1998 .
[11] Michael J. Maher,et al. Over-Constrained Systems , 1995, Lecture Notes in Computer Science.
[12] Charles J. Petrie,et al. On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.
[13] Richard J. Wallace,et al. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems , 1996, CP.
[14] Abdul Sattar,et al. Dynamic Constraint Weighting for Over-Constrained Problems , 1998, PRICAI.
[15] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..
[16] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[17] Mark S. Boddy,et al. Solving Time-Dependent Planning Problems , 1989, IJCAI.