Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference20 articles.
1. Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency restoration and explanations in dynamic CSPs application to configuration. Artificial Intelligence, 135(1–2), 199–234.
2. Bogaerts, B., Gamba, E., & Guns, T. (2021). A framework for step-wise explaining how to solve constraint satisfaction problems. Artificial Intelligence, 300, 103550.
3. Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D., & Trevisan, L. (2017). From Gap-ETH to FPT-inapproximability: Clique, dominating set, and more. In C. Umans (Ed.), Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS’17) (pp. 743–754). IEEE Computer Society
4. Lecture Notes in Computer Science;Y Chen,2006
5. Cooper, M. C., de Givry, S., Sánchez-Fibla, M., Schiex, T., & Zytnicki, M. (2008). Virtual arc consistency for weighted CSP. In D. Fox & C. P. Gomes (Eds.), AAAI 2008 (pp. 253–258). AAAI Press.