Page 214 - 《软件学报》2021年第11期

3540 Journal of Software 软件学报 Vol.32, No.11, November 2021

[9] Cheng KCK, Yap RHC. An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some
global constraints. Constraints, 2010,15(2):265−304.
[10] Perez G, Régin JC. Improving GAC-4 for table and MDD constraints. In: Proc. of the Int’l Conf. on Principles and Practice of
Constraint Programming. Cham: Springer-Verlag, 2014. 606−621.
[11] Verhaeghe H, Lecoutre C, Schaus P. Compact-MDD: Efficiently filtering (s) MDD constraints with reversible sparse bit-sets. In:
Proc. of the IJCAI. 2018. 1383−1389.
[12] Janssen P, Jégou P, Nouguier B, Vilarem M. A filtering process for general constraint-satisfaction problems: Achieving pairwise-
consistency using an associated binary representation. In: Proc. of the IEEE Int’l Workshop on Tools for Artificial Intelligence.
IEEE, 1989. 420−427.
[13] Mairy JB, Deville Y, Lecoutre C. Domain k-wise consistency made as simple as generalized arc consistency. In: Proc. of the Int’l
Conf. on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems. Cham: Springer-Verlag,
2014. 235−250.
[14] Likitvivatanavong C, Xia W, Yap RHC. Higher-order consistencies through GAC on factor variables. In: Proc. of the Int’l Conf. on
Principles and Practice of Constraint Programming. Cham: Springer-Verlag, 2014. 497−513.
[15] Likitvivatanavong C, Xia W, Yap RHC. Decomposition of the factor encoding for CSPs. In: Proc. of the 24th Int’l Joint Conf. on
Artificial Intelligence. 2015. 353−359.
[16] Bessiere C, Stergiou K, Walsh T. Domain filtering consistencies for non-binary constraints. Artificial Intelligence, 2008,172(6-7):
800−822.
[17] Paparrizou A, Stergiou K. An efficient higher-order consistency algorithm for table constraints. In: Proc. of the 26th AAAI Conf.
on Artificial Intelligence. 2012. 535−541.
[18] Lecoutre C, Paparrizou A, Stergiou K. Extending STR to a higher-order consistency. In: Proc. of the 27th AAAI Conf. on Artificial
Intelligence. 2013. 576−682.
[19] Samaras N, Stergiou K. Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results.
Journal of Artificial Intelligence Research, 2005,24:641−684.
[20] Schneider A, Choueiry BY. PW-CT: Extending compact-table to enforce pairwise consistency on table constraints. In: Proc. of the
Int’l Conf. on Principles and Practice of Constraint Programming. Cham: Springer-Verlag, 2018. 345−361.
[21] Dechter R. Constraint Processing. Morgan Kaufmann Publishers, 2003. 211−269.
[22] Verhaeghe H, Lecoutre C, Schaus P. Extending compact-table to negative and short tables. In: Proc. of the 31st AAAI Conf. on
Artificial Intelligence. 2017. 3951−3957.

附中文参考文献:
[6] 李宏博,梁艳春,李占山.负表约束的简单表缩减广泛弧相容算法.软件学报,2016,27(11):2701−2711. http://www.jos.org.cn/1000-
9825/4847.htm [doi: 10.13328/j.cnki. jos.004874]
[7] 杨明奇,李占山,李哲.优化求解约束满足问题的 MDDc 和 STR3 算法.软件学报,2017,28(12):3156−3166. http://www.jos.org.cn/
1000-9825/5242.htm [doi: 10.13328/j.cnki.jos.005242]
[8] 杨明奇,李占山,张家晨.一种基于时间戳的简单表缩减算法.软件学报,2019,30(11):3355−3363. http://www.jos.org.cn/1000-9825/
5559.htm [doi: 10.13328/j.cnki.jos.005559]

王震(1998－),男,硕士,主要研究领域为约 李占山(1966－),男,博士,教授,博士生导
束规划. 师,CCF 专业会员,主要研究领域为机器学
习,约束推理.

李哲(1990－),男,博士,主要研究领域为约
束规划,并行计算.