Abstract
AC5TC is a generic value-based domain-consistency framework for GAC propagation algorithms, which stores the information of removed values with a propagation queue. Three efficient implementations of AC5TC algorithm have been proposed in [1]. One of these algorithms (called AC5TC-Tr) has an optimal time complexity theoretically, but its space complexity is inefficient because of the dynamic data structure. This paper proposes a novel algorithm based on AC5TC framework, called AC5TC-Alter, which leverages a more efficient search strategy to establish GAC. AC5TC-Alter accesses both allowed table and valid table alternately during the process of supports seeking, also our method is scalable since it does not need data structure to maintain the validity of tuples. The experimental results show that AC5TC-Alter outperforms most baseline algorithms on time complexity and AC5TC-Tr on space complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Mairy, J.-B., Van Hentenryck, P., Deville, Y.: An optimal filtering algorithm for table constraints. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 496–511. Springer, Heidelberg (2012)
Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8, 99–118 (1977)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artif. Intell. 28, 225–233 (1986)
Van Hentenryck, P., Deville, Y., Teng, C.M.: A generic arc-consistency algorithm and its specializations. Artif. Intell. 57, 291–321 (1992)
Bessière, C.: Arc-consistency and arc-consistency again. Artif. Intell. 65(1), 179–190 (1994)
Chmeiss, A., Jégou, P.: Efficient path-consistency propagation. Int. J. Artif. Intell. Tools 7(2), 79–89 (1998)
Zhang, Y., Yap, R.: Making ac-3 an optimal algorithm. In: IJCAI 2001, pp. 316–321, Seatle (2001)
Dib, M., Abdallah, R., Crminada, A.: Arc-consistency in constraint satisfaction problems: a survey. In: Second International Conference on Computational Intelligence, Modelling and Simulation, pp. 291–296 (2010)
Lecoutre, C., Szymanek, R.: Generalized arc constraint for positive table constraints. Proc. CP 06, 284–298 (2006)
Arangu, M., salido, M.A., Barber, F.: A filtering technique to achieve 2-consistency in constraint satisfaction problem. Int. J. Innovative Comput. Inf. Control 8(6), 3891–3906 (2012)
Acknowledgments
The authors would like to express sincere thanks to our instructor, Professor Li because of his careful guidance and valuable suggestions in the process of topic selection and paper writing. Besides, our research is supported by the National Undergraduate Training Programs for Innovation and Entrepreneurship as a national project. We are grateful for this opportunity.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Qiao, L., Xu, Z., Dong, J., Shao, Y., Tong, X., Li, Z. (2016). An Ideal Fine-Grained GAC Algorithm for Table Constraints. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-41000-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40999-3
Online ISBN: 978-3-319-41000-5
eBook Packages: Computer ScienceComputer Science (R0)