{"type":"ScholarlyArticle","title":"On Neighborhood Singleton Consistencies","authors":[{"name":"Anastasia Paparrizou","slug":"anastasia-paparrizou","given":"Anastasia","family":"Paparrizou","affiliation":"CRIL-CNRS and Université d'Artois Lens , France"},{"name":"Kostas Stergiou","slug":"kostas-stergiou","given":"Kostas","family":"Stergiou","affiliation":"University of Western Macedonia Kozani , Greece"}],"abstract":"CP solvers predominantly use arc consistency (AC) as the default propagation method. Many stronger consistencies, such as triangle consistencies (e.g. RPC and maxRPC) exist, but their use is limited despite results showing that they outperform AC on many problems. This is due to the intricacies involved in incorporating them into solvers. On the other hand, singleton consistencies such as SAC can be easily crafted into solvers but they are too expensive. We seek a balance between the efficiency of triangle consistencies and the ease of implementation of singleton ones. Using the recently proposed variant of SAC called Neighborhood SAC as basis, we propose a family of weaker singleton consistencies. We study them theoretically, comparing their pruning power to existing consistencies. We make a detailed experimental study using a very simple algorithm for their implementation. Results demonstrate that they outperform the existing propagation techniques, often by orders of magnitude, on a wide range of problems.","doi":"10.24963/ijcai.2017/102","url":"https://ijcai.org/proceedings/2017/102","pdf":"https://ijcai.org/proceedings/2017/0102.pdf","markdown":"https://ijcai.org/proceedings/2017/102.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/102","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":102,"pages":{"first":736,"last":742},"keywords":["Constraints and Satisfiability: Evaluation and Analysis","Constraints and Satisfiability: Constraint Satisfaction"],"videos":[],"references":[{"position":1,"raw":"[Balafoutis et al., 2011] Thanasis Balafoutis, Anastasia Pa- parrizou, Kostas Stergiou, and Toby Walsh. New algo- rithms for max restricted path consistency. Constraints, 16(4):372-406, 2011.","title":"New algorithms for max restricted path consistency","authors":"Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Balafrej et al., 2014] Amine Balafrej, Christian Bessiere, El-Houssine Bouyakh, and Gilles Trombettoni. Adaptive Singleton-Based Consistencies. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI'14), pages 2601-2607, 2014.","title":"Adaptive Singleton-Based Consistencies","authors":"Amine Balafrej, Christian Bessiere, El-Houssine, Gilles Bouyakh, Trombettoni","year":"2014","venue":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI'14)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Berlandier, 1995] Pierre Berlandier. Improving Domain Fil- tering Using Restricted Path Consistency. In Proceedings of IEEE Conference on Artificial Intelligence and Applica- tions (CAIA'95), pages 32-37, 1995.","title":"Improving Domain Filtering Using Restricted Path Consistency","authors":"Pierre Berlandier","year":"1995","venue":"Proceedings of IEEE Conference on Artificial Intelligence and Applications (CAIA'95)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bessiere et al., 2011] Christian Bessiere, Stéphane Cardon, Romuald Debruyne, and Christophe Lecoutre. Efficient Algorithms for Singleton Arc Consistency. Constraints, 16:25-53, 2011.","title":"Efficient Algorithms for Singleton Arc Consistency","authors":"Bessiere","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Debruyne and Bessiere, 1997] Romuald Debruyne and Christian Bessiere. From restricted path consistency to max-restricted path consistency. In Proceedings of 3rd International Conference on Principles and Practice of Constraint Programming (CP'97), pages 312-326, 1997.","title":"From restricted path consistency to max-restricted path consistency","authors":"Romuald Debruyne, Christian Bessiere","year":"1997","venue":"Proceedings of 3rd International Conference on Principles and Practice of Constraint Programming (CP'97)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Debruyne and Bessiere, 2001] Romuald Debruyne and Christian Bessiere. Domain Filtering Consistencies. J. Artif. Intell. Res. (JAIR), 14:205-230, 2001.","title":"Domain Filtering Consistencies","authors":"Romuald Debruyne, Christian Bessiere","year":"2001","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Freuder and Elfe, 1996] Eugene C. Freuder and Charles D. Elfe. Neighborhood Inverse Consistency Preprocessing. In Proceedings of the 13th AAAI Conference on Artificial Intelligence (AAAI'96), pages 202-208, 1996.","title":"Neighborhood Inverse Consistency Preprocessing","authors":"Eugene C Freuder, Charles D Elfe","year":"1996","venue":"Proceedings of the 13th AAAI Conference on Artificial Intelligence (AAAI'96)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Lecoutre and Hemery, 2007] Christophe Lecoutre and Fred Hemery. A study of residual supports in arc consistency. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), pages 125-130, 2007.","title":"Christophe Lecoutre and Fred Hemery. A study of residual supports in arc consistency","authors":"Hemery Lecoutre","year":"2007","venue":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Likitvivatanavong et al., 2007] Chavalit Likitvivatanavong, Yuanlin Zhang, James Bowen, Scott Shannon, and Eu- gene C. Freuder. Arc Consistency during Search. In Pro- ceedings of the 20th International Joint Conference on Ar- tificial Intelligence (IJCAI'07), pages 137-142, 2007.","title":"Arc Consistency during Search","authors":"Chavalit Likitvivatanavong, Yuanlin Zhang, James Bowen, Scott Shannon, Eugene C Freuder","year":"2007","venue":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07)","doi":null,"url":null,"internal_url":"/proceedings/2007/20"},{"position":10,"raw":"[Stergiou, 2015] Kostas Stergiou. Restricted Path Consis- tency Revisited. In Proceedings of the 21st International Conference on Principles and Practice of Constraint Pro- gramming (CP'15), pages 419-428, 2015.","title":"Restricted Path Consistency Revisited","authors":"Kostas Stergiou","year":"2015","venue":"Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP'15)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Vion and Debruyne, 2009] Julien Vion and Romuald De- bruyne. Light Algorithms for Maintaining Max-RPC Dur- ing Search. In Proceedings of the 8th Symposium on Ab- straction, Reformulation and Approximation (SARA'09), pages 167-174, 2009.","title":"Light Algorithms for Maintaining Max-RPC During Search","authors":"Debruyne Vion","year":"2009","venue":"Proceedings of the 8th Symposium on Abstraction, Reformulation and Approximation (SARA'09)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Wallace, 2015] Richard J. Wallace. SAC and neighbour- hood SAC. AI Communications, 28(2):345-364, 2015.","title":"SAC and neighbourhood SAC","authors":"Richard J Wallace","year":"2015","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Wallace, 2016a] Richard J. Wallace. Neighbourhood SAC: Extensions and new algorithms. AI Communications, 29(2):249-268, 2016.","title":"Neighbourhood SAC: Extensions and new algorithms","authors":"Richard J Wallace","year":"2016","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Wallace, 2016b] Richard J. Wallace. Preprocessing versus search processing for constraint satisfaction problems. In Proceedings of Knowledge Representation and Automated Reasoning (RCRA'16), pages 89-103, 2016.","title":"Preprocessing versus search processing for constraint satisfaction problems","authors":"Richard J Wallace, Wallace","year":"2016","venue":"Proceedings of Knowledge Representation and Automated Reasoning (RCRA'16)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}