Abstract
A basic technique used in algorithms for constraint satisfaction problems (CSPs) is removing values that are locally inconsistent, since they cannot form part of a globally consistent solution. The best-known algorithms of this type establish arc consistency (AC), where every value has support in neighbouring domains. Here, we consider algorithms that use AC repeatedly under severe local assumptions to achieve higher overall levels of consistency. These algorithms establish (neighbourhood) singleton arc consistency ((N)SAC). Most of these use simple AC interleaved with the basic (N)SAC procedure. To date, however, this strategy of interleaving weaker and stronger forms of reasoning has not received much attention in and of itself. Moreover, one of the best (N)SAC algorithms (called (N)SACQ) does not use this method. This paper investigates the effects of interleaving and presents new methods based on this idea. We show that different kinds of problems vary greatly in their amenability to AC interleaving; while in most cases it is beneficial, with some algorithms and problem types it can be harmful. More significantly, when this feature is added to (N)SACQ algorithms, the latter’s superiority to other (N)SAC algorithms becomes more consistent and decisive. We also consider an AC-4 based approach to interleaving as well as interleaving with stronger methods than AC.
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
Balafrej, A., Bessière, C., Bouyakhf, E., Trombettoni, G.: Adaptive singleton-based consistencies. In: Twenty-Eighth AAAI Conference on Artificial Intelligence - AAAI 2014, pp. 2601–2607. AAAI (2014)
Bessière, C., Cardon, S., Debruyne, R., Lecoutre, C.: Efficient algorithms for singleton arc consistency. Constraints 16, 25–53 (2011)
Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Fifteenth International Joint Conference on Artifcial Intelligence - IJCAI 1997, vol. 1. pp. 412–417. Morgan Kaufmann (1997)
Granvilliers, L., Monfroy, E.: Implementing constraint propagation by composition of reductions. In: Proceedings Nineteenth International Conference on Logic Programming. LNCS No. 2916. pp. 300–314. Springer (2003)
Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Fourteenth International Joint Conference on Artificial Intelligence - IJCAI 2005, pp. 199–204. Professional Book Center (2005)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artif. Intell. 28, 225–233 (1986)
Paparrizou, A., Stergiou, K.: Evaluating simple fully automated heuristics for adaptive constraint propagation. In: Twenty-Fourth International Conference on Tools with Artificial Intelligence - ICTAI 2012, pp. 880–885 (2012)
Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Trans. Program. Lang. Syst. 31(1), 1–43 (2008)
Stergiou, K.: Restricted path consistency revisited. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 419–428. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23219-5_30
Wallace, R.J.: Light-weight versus heavy-weight algorithms for SAC and neighbourhood SAC. In: Russell, I., Eberle, W. (eds.) Twenty-Eighth International Florida Artificial Intelligence Research Society Conference - FLAIRS-28, pp. 91–96. AAAI Press (2015)
Wallace, R.J.: SAC and neighbourhood SAC. AI Commun. 28, 345–364 (2015)
Acknowledgements
I thank the anonymous reviewers for their close reading and apposite comments, which definitely improved the quality of the paper. This work was done using facilities supported by Science Foundation Ireland.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Wallace, R.J. (2021). Interleaving Levels of Consistency Enforcement for Singleton Arc Consistency in CSPs, with a New Best (N)SAC Algorithm. In: Baldoni, M., Bandini, S. (eds) AIxIA 2020 – Advances in Artificial Intelligence. AIxIA 2020. Lecture Notes in Computer Science(), vol 12414. Springer, Cham. https://doi.org/10.1007/978-3-030-77091-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-77091-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77090-7
Online ISBN: 978-3-030-77091-4
eBook Packages: Computer ScienceComputer Science (R0)