{"type":"ScholarlyArticle","title":"Variable Elimination in Binary CSPs (Extended Abstract)","authors":[{"name":"Martin C. Cooper","slug":"martin-c-cooper","given":"Martin C.","family":"Cooper","affiliation":"IRIT , University of Toulouse III , France"},{"name":"Achref El Mouelhi","slug":"achref-el-mouelhi","given":"Achref","family":"El Mouelhi","affiliation":"H & H: Research and Training , Marseille , France"},{"name":"Cyril Terrioux","slug":"cyril-terrioux","given":"Cyril","family":"Terrioux","affiliation":"Aix Marseille Univ , Université de Toulon , CNRS , LIS , Marseille , France"}],"abstract":"We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each defines a novel tractable class. Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without.","doi":"10.24963/ijcai.2020/702","url":"https://ijcai.org/proceedings/2020/702","pdf":"https://ijcai.org/proceedings/2020/0702.pdf","markdown":"https://ijcai.org/proceedings/2020/702.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/702","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Journal track","track":"Journal track","number":702,"pages":{"first":5035,"last":5039},"keywords":["Constraints and SAT: Constraint Satisfaction"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24724/file_24724.m3u8","length_sec":205,"provider":"hls"}],"references":[{"position":1,"raw":"[Beigel and Eppstein, 1995] Richard Beigel and David Epp- stein. 3-Coloring in Time O(1.3446 n ): A No-MIS Algo- rithm. In 36th Annual Symposium on Foundations of Com- puter Science, Milwaukee, Wisconsin, USA, pages 444- 452. IEEE Computer Society, 1995.","title":"3-Coloring in Time O(1.3446 n ): A No-MIS Algorithm","authors":"Richard Beigel, David Eppstein","year":"1995","venue":"36th Annual Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bessière et al., 2005] Christian Bessière, Jean-Charles Régin, Roland H. C. Yap, and Yuanlin Zhang. An optimal coarse-grained arc consistency algorithm. Artif. Intell., 165(2):165-185, 2005.","title":"An optimal coarse-grained arc consistency algorithm","authors":"Bessière","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cohen et al., 2015] David A. Cohen, Martin C. Cooper, Guillaume Escamocher, and Stanislav Zivny. Variable and value elimination in binary constraint satisfaction via for- bidden patterns. J. Comput. Syst. Sci., 81(7):1127-1143, 2015.","title":"Variable and value elimination in binary constraint satisfaction via forbidden patterns","authors":"David A Cohen, Martin C Cooper, Guillaume Escamocher, Stanislav Zivny","year":"2015","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cooper et al., 2010] Martin C. Cooper, Peter G. Jeavons, and András Z. Salamon. Generalizing constraint satisfac- tion on trees: Hybrid tractability and variable elimination. Artif. Intell., 174(9-10):570-584, 2010.","title":"Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination","authors":"Martin C Cooper, Peter G Jeavons, András Z Salamon","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cooper et al., 2016] Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Ter- rioux, and Bruno Zanuttini. Broken triangles: From value merging to a tractable class of general-arity constraint sat- isfaction problems. Artif. Intell., 234:196-218, 2016.","title":"Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems","authors":"Martin C Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cooper et al., 2019] Martin C. Cooper, Achref El Mouelhi, and Cyril Terrioux. Variable elimination in binary CSPs. J. Artif. Intell. Res., 66:589-624, 2019.","title":"Variable elimination in binary CSPs","authors":"Martin C Cooper, Achref El Mouelhi, Cyril Terrioux","year":"2019","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cooper, 2014] Martin C. Cooper. Beyond Consistency and Substitutability. In Barry O'Sullivan, editor, Principles and Practice of Constraint Programming -20th Interna- tional Conference, CP 2014, Lyon, France, volume 8656 of Lecture Notes in Computer Science, pages 256-271. Springer, 2014.","title":"Beyond Consistency and Substitutability","authors":"Martin C Cooper","year":"2014","venue":"Principles and Practice of Constraint Programming -20th International Conference","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dechter, 1999] Rina Dechter. Bucket Elimination: A Unify- ing Framework for Reasoning. Artif. Intell., 113(1-2):41- 85, 1999.","title":"Bucket Elimination: A Unifying Framework for Reasoning","authors":"Rina Dechter","year":"1999","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Freuder, 1991] Eugene C. Freuder. Eliminating inter- changeable values in constraint satisfaction problems. In","title":"Eliminating interchangeable values in constraint satisfaction problems","authors":"Eugene C Freuder","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Thomas L. Dean and Kathleen R. McKeown, editors, Pro- ceedings of the 9th National Conference on Artificial Intel- ligence, Anaheim, CA, USA, 1991, Volume 1., pages 227- 233. AAAI Press / The MIT Press, 1991.","title":"Proceedings of the 9th National Conference on Artificial Intelligence","authors":null,"year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jeavons et al., 1998] Peter Jeavons, David A. Cohen, and Martin C. Cooper. Constraints, Consistency and Closure. Artif. Intell., 101(1-2):251-265, 1998.","title":"Constraints, Consistency and Closure","authors":"Peter Jeavons, David A Cohen, Martin C Cooper","year":"1998","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Koubarakis, 2006] Manolis Koubarakis. Temporal CSPs. In Francesca Rossi, Peter van Beek, and Toby Walsh, editors, Handbook of Constraint Programming, volume 2 of Foun- dations of Artificial Intelligence, pages 665-697. Elsevier, 2006.","title":"Temporal CSPs","authors":"Manolis Koubarakis","year":"2006","venue":"Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kratsch et al., 2016] Stefan Kratsch, Geevarghese Philip, and Saurabh Ray. Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms, 12(3):40:1- 40:16, 2016.","title":"Point Line Cover: The Easy Kernel is Essentially Tight","authors":"Stefan Kratsch, Geevarghese Philip, Saurabh Ray","year":"2016","venue":"ACM Trans. Algorithms","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Larrosa and Dechter, 2003] Javier Larrosa and Rina Dechter. Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints, 8(3):303-326, 2003.","title":"Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems","authors":"Dechter Larrosa, Javier Larrosa, Rina Dechter","year":"2003","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lecoutre, 2009] Christophe Lecoutre. Constraint Networks Techniques and Algorithms. ISTE/Wiley, 2009.","title":"Constraint Networks Techniques and Algorithms","authors":"Christophe Lecoutre","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Newman et al., 2018] Neil Newman, Alexandre Fréchette, and Kevin Leyton-Brown. Deep optimization for spectrum repacking. Commun. ACM, 61(1):97-104, 2018.","title":"Deep optimization for spectrum repacking","authors":"Neil Newman, Alexandre Fréchette, Kevin Leyton-Brown","year":"2018","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Schrijver, 1999] Alexander Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience Series in Dis- crete Mathematics and Optimization. Wiley, 1999.","title":"Theory of Linear and Integer Programming","authors":"Alexander Schrijver","year":"1999","venue":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Subbarayan and Pradhan, 2004] Sathiamoorthy Sub- barayan and Dhiraj K. Pradhan. NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT instances. In SAT 2004 -The 7th International Conference on Theory and Applications of Satisfiability Testing, Vancouver, Canada, Online Proceedings, 2004.","title":"Sathiamoorthy Subbarayan and Dhiraj K. Pradhan. NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT instances","authors":"Pradhan Subbarayan","year":"2004","venue":"SAT 2004 -The 7th International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zhang and Yap, 2011] Yuanlin Zhang and Roland H. C. Yap. Solving functional constraints by variable substitu- tion. TPLP, 11(2-3):297-322, 2011.","title":"Solving functional constraints by variable substitution","authors":"Yap ; ] Yuanlin Zhang, Roland H C Zhang, Yap","year":"2011","venue":"TPLP","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}