1. Bofill, M., Busquets, D., Villaret, M.: A declarative approach to robust weighted Max-SAT. In: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2010), pp. 67–76 (2010)
2. Climent, L., Salido, M., Barber, F.: Reformulating dynamic linear constraint satisfaction problems as weighted CSPs for searching robust solutions. In: Proceedings of the 9th Symposium of Abstraction, Reformulation, and Approximation (SARA 2011), pp. 34–41 (2011)
3. Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1988), pp. 37–42 (1988)
4. Lecture Notes in Computer Science;H. Fargier,1993
5. Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 175–180 (1996)