Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes-Reference-Cited by-同舟云学术

Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes

Published:2000 Issue: Volume: Page:500-504
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2000
language:
Short-container-title:

Author:

Fowler David W.,Brown Kenneth N.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45349-0_38

Reference8 articles.

1. S. Bistarelli, U. Montanari, and F. Rossi. Constraint solving over semirings. In Proceedings of IJCAI-95, pages 624–630, 1995.

2. M. Drummond, J. Bresina, and K. Swanson. Just-in-case scheduling. In Proceedings of AAAI-94, Seattle, Washington, USA, 1994.

3. R. Dechter and A. Dechter. Belief maintenance in dynamic constraint networks. In Proceedings of AAAI-88, pages 37–43, 1988.

4. D. W. Fowler and K. N. Brown. Branching constraint satisfaction problems. Technical report, Dept. of Computing Science, Univ. of Aberdeen, 2000.

5. H. Fargier, J. Lang, and T. Schiex. Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In Proceedings of AAAI-96, Portland, OR, 1996.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. (1,0)-Super Solutions of (k,s)-CNF Formula;Entropy;2020-02-23

2. Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings;Artificial Intelligence Review;2013-08-15

3. Modeling Robustness in CSPs as Weighted CSPs;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2013

4. Stochastic Constraint Programming: A Scenario-Based Approach;Constraints;2006-01

5. Constraint Solving in Uncertain and Dynamic Environments: A Survey;Constraints;2005-07