Arc-consistency in dynamic CSPs is no more prohibitive
暂无分享,去创建一个
[1] Christian Bessiere,et al. Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.
[2] Eugene C. Freuder,et al. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..
[3] Bertrand Neveu,et al. Maintaining arc consistency through constraint retraction , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.
[4] Philippe Jégou,et al. Synthia: Assisted Design of Peptide Synthesis Plans , 1991 .
[5] Richard J. Wallace,et al. Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.
[6] Barbara M. Smith. How to Solve the Zebra Problem, or Path Consistency the Easy Way , 1992, ECAI.
[7] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[8] Romuald Debruyne,et al. Les algorithmes d'arc-consistance dans les CSP dynamiques , 1995 .
[9] Rina Dechter,et al. Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.
[10] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[11] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..