{"type":"ScholarlyArticle","title":"Conflict Directed Clause Learning for Maximum Weighted Clique Problem","authors":[{"name":"Emmanuel Hebrard","slug":"emmanuel-hebrard","given":"Emmanuel","family":"Hebrard","affiliation":"LAAS-CNRS , Université de Toulouse , CNRS , Toulouse , France"},{"name":"George Katsirelos","slug":"george-katsirelos","given":"George","family":"Katsirelos","affiliation":"MIAT , INRA , Toulouse , France"}],"abstract":"The maximum clique and minimum vertex cover problems are among Karp's 21 NP-complete problems, and have numerous applications: in combinatorial auctions, for computing phylogenetic trees, to predict the structure of proteins, to analyse social networks, and so forth. Currently, the best complete methods are branch & bound algorithms and rely largely on graph colouring to compute a bound. We introduce a new approach based on SAT and on the \"Conflict-Driven Clause Learning\" (CDCL) algorithm. We propose an efficient implementation of Babel's bound and pruning rule, as well as a novel dominance rule. Moreover, we show how to compute concise explanations for this inference. Our experimental results show that this approach is competitive and often outperforms the state of the art for finding cliques of maximum weight.","doi":"10.24963/ijcai.2018/183","url":"https://ijcai.org/proceedings/2018/183","pdf":"https://ijcai.org/proceedings/2018/0183.pdf","markdown":"https://ijcai.org/proceedings/2018/183.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/183","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":183,"pages":{"first":1316,"last":1323},"keywords":["Constraints and SAT: Constraints and SAT","Constraints and SAT: Constraint Optimisation"],"videos":[],"references":[{"position":1,"raw":"[Babel, 1994] Luitpold Babel. A Fast Algorithm for the Maximum Weight Clique Problem. Computing, 52(1):31- 38, 1994.","title":"Luitpold Babel. A Fast Algorithm for the Maximum Weight Clique Problem","authors":"Babel","year":"1994","venue":"Computing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bomze et al., 1999] Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos, and Marcello Pelillo. The Maximum Clique Problem. In Handbook of Combinatorial Optimiza- tion, pages 1-74. Kluwer Academic Publishers, 1999.","title":"The Maximum Clique Problem","authors":"Immanuel M Bomze, Marco Budinich, Panos M Pardalos, Marcello Pelillo","year":"1999","venue":"Handbook of Combinatorial Optimization","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brélaz, 1979] Daniel Brélaz. New Methods to Color the Vertices of a Graph. Commun. ACM, 22(4):251-256, 1979.","title":"New Methods to Color the Vertices of a Graph","authors":"Daniel Brélaz","year":"1979","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Day and Sankoff, 1986] William H. E. Day and David Sankoff. Computational Complexity of Inferring Phylo- genies by Compatibility. Systematic Zoology, 35(2):224- 229, 1986.","title":"Computational Complexity of Inferring Phylogenies by Compatibility","authors":"H E William, David Day, Sankoff","year":"1986","venue":"Systematic Zoology","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dickerson et al., 2012] John P Dickerson, Ariel D Procac- cia, and Tuomas Sandholm. Optimizing kidney exchange with transplant chains: Theory and reality. In Proceed- ings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, pages 711- 718. International Foundation for Autonomous Agents and Multiagent Systems, 2012.","title":"Optimizing kidney exchange with transplant chains: Theory and reality","authors":"Ariel D John P Dickerson, Tuomas Procaccia, Sandholm","year":"2012","venue":"Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Fang et al., 2016] Zhiwen Fang, Chu-Min Li, and Ke Xu. An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem. J. Artif. Int. Res., 55(1):799-833, 2016.","title":"An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem","authors":"Zhiwen Fang, Chu-Min Li, Ke Xu","year":"2016","venue":"J. Artif. Int. Res","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Jiang et al., 2017] Hua Jiang, Chu-Min Li, and Felip Manyà. An exact algorithm for the maximum weight clique problem in large graphs. In Proceedings of the 31st Conference on Artificial Intelligence (AAAI), pages 830- 838, 2017.","title":"An exact algorithm for the maximum weight clique problem in large graphs","authors":"Hua Jiang, Chu-Min Li, Felip Manyà","year":"2017","venue":"Proceedings of the 31st Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Jiang et al., 2018] Hua Jiang, Chu-Min Li, Yanli Liu, and Felip Manyà. A two-stage maxsat reasoning approach for the maximum weight clique problem. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelli- gence (AAAI-2018), 2018.","title":"A two-stage maxsat reasoning approach for the maximum weight clique problem","authors":"Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà","year":"2018","venue":"Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-2018)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Katsirelos and Bacchus, 2005] George Katsirelos and Fahiem Bacchus. Generalized nogoods in CSPs. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), 2005.","title":"George Katsirelos and Fahiem Bacchus. Generalized nogoods in CSPs","authors":"Bacchus Katsirelos","year":"2005","venue":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lau and Goh, 2002] Hoong Chuin Lau and Yam Guan Goh. An intelligent brokering system to support multi-agent web-based 4/sup th/-party logistics. In Proceedings of the 14th IEEE International Conference on Tools with Ar- tificial Intelligence (ICTAI 2002), pages 154-161. IEEE, 2002.","title":"An intelligent brokering system to support multi-agent web-based 4/sup th/-party logistics","authors":"Goh ; ] Lau, Chuin Hoong, Yam Guan Lau, Goh","year":"2002","venue":"Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2002)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lick and White, 1970] Don R. Lick and Arthur T White. k-degenerate graphs. Canadian Journal of Mathematics, 22:1082-1096, 1970. doi:10.4153/CJM-1970-125-1.","title":"k-degenerate graphs","authors":"Don R Lick, Arthur T White","year":"1970","venue":"Canadian Journal of Mathematics","doi":"10.4153/cjm-1970-125-1","url":null,"internal_url":null},{"position":12,"raw":"[MacWilliams and Sloane, 1978] Florence J. MacWilliams and Neil J.A. Sloane. The Theory of Error-Correcting Codes. North-holland Publishing Company, 2nd edition, 1978.","title":"The Theory of Error-Correcting Codes","authors":"Florence J Macwilliams, J A Neil, Sloane","year":"1978","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Manlove and O'malley, 2015] David F. Manlove and Gregg O'malley. Paired and altruistic kidney donation in the uk: Algorithms and experimentation. J. Exp. Algorithmics, 19:2.6:1-2.6:21, January 2015.","title":"Paired and altruistic kidney donation in the uk: Algorithms and experimentation","authors":"David F Manlove, O' Gregg, Malley","year":"2015","venue":"J. Exp. Algorithmics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Marques Silva and Sakallah, 1999] Joao P. Marques Silva and Karem A. Sakallah. GRASP-a search algorithm for propositional satisfiability. IEEE Transactions on Comput- ers, 48(5):506-521, May 1999.","title":"GRASP-a search algorithm for propositional satisfiability","authors":"Joao P Marques Silva, Karem A Sakallah","year":"1999","venue":"IEEE Transactions on Computers","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McCreesh and Prosser, 2014] Ciaran McCreesh and Patrick Prosser. Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. In Pro- ceedings of the 20th International Conference on Princi- ples and Practice of Constraint Programming (CP), pages 549-563, 2014.","title":"Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem","authors":"Prosser Mccreesh, Ciaran Mccreesh, Patrick Prosser","year":"2014","venue":"Proceedings of the 20th International Conference on Principles and Practice of Constraint Programming (CP)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[McCreesh et al., 2017] Ciaran McCreesh, Patrick Prosser, Kyle Simpson, and James Trimble. On Maximum Weight Clique Algorithms, and How They Are Evaluated. In Proceedings of the 23rd International Conference on the Principles and Practice of Constraint Programming (CP), pages 206-225, 2017.","title":"On Maximum Weight Clique Algorithms, and How They Are Evaluated","authors":"Ciaran Mccreesh, Patrick Prosser, Kyle Simpson, James Trimble","year":"2017","venue":"Proceedings of the 23rd International Conference on the Principles and Practice of Constraint Programming (CP)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Mitchell, 2005] David G. Mitchell. A SAT solver primer. EATCS Bulletin, 85:112-132, 2005.","title":"A SAT solver primer","authors":"David G Mitchell","year":"2005","venue":"EATCS Bulletin","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Moskewicz et al., 2001] Matthiew Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceed- ings of the 39th Design Automation Conference (DAC), pages 530-535, 2001.","title":"Chaff: Engineering an efficient SAT solver","authors":"Moskewicz","year":"2001","venue":"Proceedings of the 39th Design Automation Conference (DAC)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Östergård, 2001] Patric R. J. Östergård. A New Algorithm for the Maximum-weight Clique Problem. Nordic J. of Computing, 8(4):424-436, 2001.","title":"A New Algorithm for the Maximum-weight Clique Problem","authors":"R J Patric, Östergård","year":"2001","venue":"Nordic J. of Computing","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Östergård, 2002] Patric R. J. Östergård. A fast algorithm for the maximum clique problem. Discrete Applied Math- ematics, 120(1-3):197 -207, 2002. Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization.","title":"A fast algorithm for the maximum clique problem","authors":"R J Patric, Östergård","year":"2002","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Pullan, 2008] Wayne Pullan. Approximating the maximum vertex/edge weighted clique using local search. Journal of Heuristics, 14(2):117-134, Apr 2008.","title":"Approximating the maximum vertex/edge weighted clique using local search","authors":"Wayne Pullan","year":"2008","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Samudrala and Moult, 1998] Ram Samudrala and John Moult. A Graph-theoretic Algorithm for Comparative Modeling of Protein Structure. Journal of Molecular Biol- ogy, 279(1):287-302, 5 1998.","title":"A Graph-theoretic Algorithm for Comparative Modeling of Protein Structure","authors":"Moult Samudrala, Ram Samudrala, John Moult","year":"1998","venue":"Journal of Molecular Biology","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Shimizu et al., 2017] Satoshi Shimizu, Kazuaki Yam- aguchi, Toshiki Saitoh, and Sumio Masuda. Fast maximum weight clique extraction algorithm: Opti- mal tables for branch-and-bound. Discrete Applied Mathematics, 223:120-134, 2017.","title":"Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound","authors":"Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda","year":"2017","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Strickland et al., 2005] Dawn M. Strickland, Earl Barnes, and Joel S. Sokol. Optimal Protein Structure Align- ment Using Maximum Cliques. Operations Research, 53(3):389-402, 2005.","title":"Optimal Protein Structure Alignment Using Maximum Cliques","authors":"Dawn M Strickland, Earl Barnes, Joel S Sokol","year":"2005","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Tavares, 2016] Wladimir Araujo Tavares. Algoritmos exatos para problema da clique maxima ponderada. (Exact al- gorithms for the maximum-weight clique problem / Algo- rithmes pour le problème de la clique de poids maximum). PhD thesis, University of Avignon, France, 2016.","title":"Algoritmos exatos para problema da clique maxima ponderada","authors":"Wladimir Araujo, Tavares","year":"2016","venue":"Exact algorithms for the maximum-weight clique problem / Algorithmes pour le problème de la clique de poids maximum","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Östergård, 1999] Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Electronic Notes in Discrete Mathematics, 3:153 -156, 1999. 6th Twente Workshop on Graphs and Combinatorial Optimization.","title":"A new algorithm for the maximum-weight clique problem","authors":"R J Patric, Östergård","year":"1999","venue":"Electronic Notes in Discrete Mathematics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}