{"type":"ScholarlyArticle","title":"Reasoning about NP-complete Constraints","authors":[{"name":"Emmanuel Hebrard","slug":"emmanuel-hebrard","given":"Emmanuel","family":"Hebrard","affiliation":"LAAS-CNRS , Université de Toulouse , CNRS , Toulouse , France"}],"abstract":"The concept of local consistency – making global deductions from local infeasibility – is central to constraint programming. When reasoning about NP-complete constraints, however, since achieving a ``complete'' form of local consistency is often considered too hard, we need other tools to design and analyze propagation algorithms.\r\nIn this paper, we argue that NP-complete constraints are an essential part of constraint programming, that designing dedicated methods has lead to, and will bring, significant breakthroughs, and that we need to carefully investigate methods to deal about a necessarily incomplete inference. In particular, we advocate the use of fixed-parameter tractability and kernelization to this purpose.","doi":"10.24963/ijcai.2018/807","url":"https://ijcai.org/proceedings/2018/807","pdf":"https://ijcai.org/proceedings/2018/0807.pdf","markdown":"https://ijcai.org/proceedings/2018/807.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/807","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":"Early Career","track":"Early Career","number":807,"pages":{"first":5672,"last":5676},"keywords":["Constraints and SAT: Constraint Satisfaction","Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Constraints and SAT: Global Constraints"],"videos":[],"references":[{"position":1,"raw":"[Abu-Khzam et al., 2007] Faisal N Abu-Khzam, Michael R Fellows, Michael A Langston, and W Henry Suters. Crown Structures for Vertex Cover Kernelization. Theory of Computing Systems, 41(3):411-430, 2007.","title":"Crown Structures for Vertex Cover Kernelization","authors":"Faisal N Abu-Khzam, Michael A Michael R Fellows, W Langston, Suters Henry","year":"2007","venue":"Theory of Computing Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baptiste and Le Pape, 1995] Philippe Baptiste and Claude Le Pape. A Theoretical and Experimental Compari- son of Constraint Propagation Techniques for Disjunc- tive Scheduling. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 600- 606, 1995.","title":"A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling","authors":"Le Baptiste, Philippe Pape, Claude Le Baptiste, Pape","year":"1995","venue":"Proceedings of the 14th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1995/79"},{"position":3,"raw":"[Baptiste and Le Pape, 1997] Philippe Baptiste and Claude Le Pape. Constraint propagation and decomposition tech- niques for highly disjunctive and highly cumulative project scheduling problems. In Proceedings of the 3rd Inter- national Conference on Principles and Practice of Con- straint Programming, pages 375-389, 1997.","title":"Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems","authors":"Le Baptiste, Philippe Pape, Claude Le Baptiste, Pape","year":"1997","venue":"Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Beldiceanu and Carlsson, 2001] Nicolas Beldiceanu and Mats Carlsson. Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. In Proceedings of the 7th International Conference on Prin- ciples and Practice of Constraint Programming, pages 377-391, 2001.","title":"Nicolas Beldiceanu and Mats Carlsson. Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint","authors":"Carlsson Beldiceanu","year":"2001","venue":"Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Beldiceanu, 2001] Nicolas Beldiceanu. Pruning for the Minimum Constraint Family and for the Number of Dis- tinct Values Constraint Family. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, pages 211-224, 2001.","title":"Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family","authors":"Nicolas Beldiceanu, Beldiceanu","year":"2001","venue":"Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bessiere et al., 2006a] Christian Bessiere, Emmanuel He- brard, Brahim Hnich, Zeynep Kiziltan, and Toby Walsh. Filtering Algorithms for the NValue Constraint. Con- straints, 11(4):271-293, 2006.","title":"Filtering Algorithms for the NValue Constraint","authors":"Bessiere","year":"2006","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bessiere et al., 2006b] Christian Bessiere, Emmanuel He- brard, Brahim Hnich, and Toby Walsh. The Complex- ity of Reasoning with Global Constraints. Constraints, 12(2):239-259, 2006.","title":"Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. The Complexity of Reasoning with Global Constraints","authors":"Bessiere","year":"2006","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bessiere et al., 2008] Christian Bessiere, Emmanuel He- brard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quim- per, and Toby Walsh. The Parameterized Complexity of Global Constraints. In Proceedings of the 23rd Na- tional Conference on Artificial Intelligence, pages 235- 240, 2008.","title":"The Parameterized Complexity of Global Constraints","authors":"Bessiere","year":"2008","venue":"Proceedings of the 23rd National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bessiere et al., 2010] Christian Bessiere, George Katsire- los, Nina Narodytska, Claude-Guy Quimper, and Toby Walsh. Decomposition of the NValue Constraint. In Pro- ceedings of the 16th International Conference on Princi- ples and Practice of Constraint Programming, pages 114- 128, 2010.","title":"Christian Bessiere, George Katsirelos, Nina Narodytska","authors":"Bessiere","year":"2010","venue":"Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cambazard et al., 2012] Hadrien Cambazard, Eoin O'Mahony, and Barry O'Sullivan. A Shortest Path- based Approach to the Multileaf Collimator Sequencing Problem. Discrete Applied Mathematics, 160(1-2):81-99, 2012.","title":"A Shortest Pathbased Approach to the Multileaf Collimator Sequencing Problem","authors":"Hadrien Cambazard, O' Eoin, Barry O' Mahony, Sullivan","year":"2012","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Carbonnel and Hebrard, 2016] Clément Carbonnel and Em- manuel Hebrard. Propagation via Kernelization: the Ver- tex Cover Constraint. In Proceedings of the 22nd Inter- national Conference on Principles and Practice of Con- straint Programming, pages 147-156, 2016.","title":"Propagation via Kernelization: the Vertex Cover Constraint","authors":"Hebrard Carbonnel, Clément Carbonnel, Emmanuel Hebrard","year":"2016","venue":"Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Carbonnel and Hebrard, 2017] Clément Carbonnel and Em- manuel Hebrard. On the kernelization of global con- straints. In Proceedings of the 26th International Joint Conference on Artificial Intelligence, pages 578-584, 2017.","title":"On the kernelization of global constraints","authors":"Hebrard Carbonnel, Clément Carbonnel, Emmanuel Hebrard","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2017/81"},{"position":13,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parame- terized algorithms. Springer, 2015.","title":"Parameterized algorithms","authors":"Marek Cygan, Łukasz Fedor V Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michał Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Downey et al., 1999] Rod G. Downey, Michael R. Fellows, and Ulrike Stege. Parameterized Ccomplexity: A Frame- work for Systematically Confronting Computational In- tractability. Contemporary Trends in Discrete Mathemat- ics: From DIMACS and DIMATIA to the Future, pages 49-99, 1999.","title":"Parameterized Ccomplexity: A Framework for Systematically Confronting Computational Intractability","authors":"Rod G Downey, Michael R Fellows, Ulrike Stege","year":"1999","venue":"Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ducomman et al., 2016] Sylvain Ducomman, Hadrien Cambazard, and Bernard Penz. Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW. In Proceedings of the 30th National Conference on Artificial Intelligence, pages 3390-3396, 2016.","title":"Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW","authors":"Hadrien Sylvain Ducomman, Bernard Cambazard, Penz","year":"2016","venue":"Proceedings of the 30th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fahle, 2002] Thorsten Fahle. Integrating concepts from constraint programming and operations research algo- rithms. PhD thesis, University of Paderborn, 2002.","title":"Integrating concepts from constraint programming and operations research algorithms","authors":"Thorsten Fahle","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gaspers and Szeider, 2011] Serge Gaspers and Stefan Szei- der. Kernels for Global Constraints. In Proceedings of the 22nd International Joint Conference on Artificial Intelli- gence, pages 540-545, 2011.","title":"Serge Gaspers and Stefan Szeider","authors":"Szeider Gaspers","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hadzic and Hooker, 2007] Tarik Hadzic and John N. Hooker. Cost-Bounded Binary Decision Diagrams for 0-1 Programming. In Proceedings of the 4th International Conference on Integration of AI and OR Techniques in CP, pages 84-98, 2007.","title":"Cost-Bounded Binary Decision Diagrams for 0-1 Programming","authors":"Tarik Hadzic, John N Hooker","year":"2007","venue":"Proceedings of the 4th International Conference on Integration of AI and OR Techniques in CP","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hagerup, 2012] Torben Hagerup. Kernels for Edge Domi- nating Set: Simpler or Smaller. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, pages 491-502, 2012.","title":"Kernels for Edge Dominating Set: Simpler or Smaller","authors":"Torben Hagerup, Hagerup","year":"2012","venue":"Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hebrard et al., 2009] Emmanuel Hebrard, Daniel Marx, Barry O'Sullivan, and Igor Razgon. Constraints of Dif- ference and Equality: A Complete Taxonomic Character- isation. In Proceedings of the 15th International Confer- ence on Principles and Practice of Constraint Program- ming, pages 424-438, 2009.","title":"Constraints of Difference and Equality: A Complete Taxonomic Characterisation","authors":"Emmanuel Hebrard, Daniel Marx, O' Barry, Igor Sullivan, Razgon","year":"2009","venue":"Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hentenryck, 2013] Pascal Van Hentenryck. Computational Disaster Management. In Proceedings of the 23rd Inter- national Joint Conference on Artificial Intelligence, 2013.","title":"Computational Disaster Management","authors":"Pascal Van Hentenryck","year":"2013","venue":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2013/14"},{"position":22,"raw":"[Hopcroft and Karp, 1973] John E. Hopcroft and Richard M. Karp. An n 5/2 Algorithm for Maximum Matchings in Bi- partite Graphs. SIAM J. Comput., 2(4):225-231, 1973.","title":"An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs","authors":"John E Hopcroft, Richard M Karp","year":"1973","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kutz et al., 2008] Martin Kutz, Khaled M. Elbassioni, Irit Katriel, and Meena Mahajan. Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci., 74(5):884-897, 2008.","title":"Simultaneous matchings: Hardness and approximation","authors":"Martin Kutz, M Khaled, Irit Elbassioni, Meena Katriel, Mahajan","year":"2008","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Le Pape, 1988] Claude Le Pape. Des systèmes d'ordonnancement flexibles et opportunistes. PhD thesis, Université Paris XI, 1988.","title":"Claude Le Pape. Des systèmes d'ordonnancement flexibles et opportunistes","authors":"Le Pape","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Narodytska, 2011] Nina Narodytska. Reformulation of global constraints. PhD thesis, University of New South Wales, Sydney, Australia, 2011.","title":"Reformulation of global constraints","authors":"Nina Narodytska","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Nemhauser and Trotter Jr, 1975] George L Nemhauser and Leslie E Trotter Jr. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8(1):232- 248, 1975.","title":"Vertex packings: Structural properties and algorithms","authors":"Trotter Nemhauser, ; ] Jr, L George, Leslie E Nemhauser, Trotter","year":"1975","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Nuijten and Aarts, 1994] Wim Nuijten and Emile Aarts. Constraint satisfaction for multiple capacitated job shop scheduling. In Proceedings of the 11th European Confer- ence on Artificial Intelligence, pages 635-639, 1994.","title":"Constraint satisfaction for multiple capacitated job shop scheduling","authors":"Aarts Nuijten, Wim Nuijten, Emile Aarts","year":"1994","venue":"Proceedings of the 11th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Ouellet and Quimper, 2013] Pierre Ouellet and Claude-Guy Quimper. Time-Table Extended-Edge-Finding for the Cu- mulative Constraint. In Proceedings of the 19th Inter- national Conference on Principles and Practice of Con- straint Programming, pages 562-577, 2013.","title":"Time-Table Extended-Edge-Finding for the Cumulative Constraint","authors":"Quimper Ouellet, Pierre Ouellet, Claude-Guy Quimper","year":"2013","venue":"Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Pachet and Roy, 1999] Franc ¸ois Pachet and Pierre Roy. Au- tomatic Generation of Music Programs. In Proceedings of the 5th International Conference on Principles and Prac- tice of Constraint Programming, pages 331-345, 1999.","title":"Franc ¸ois Pachet and Pierre Roy. Automatic Generation of Music Programs","authors":"Roy Pachet","year":"1999","venue":"Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Pesant, 2004] G. Pesant. A Regular Language Membership Constraint for Finite Sequences of Variables. In Proceed- ings of the 10th International Conference on Principles and Practice of Constraint Programming, pages 482-495, 2004.","title":"A Regular Language Membership Constraint for Finite Sequences of Variables","authors":"G Pesant","year":"2004","venue":"Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Quimper et al., 2004] Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, and Alexander Golyn- ski. Improved Algorithms for the Global Cardinality Constraint. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, pages 542-556, 2004.","title":"Improved Algorithms for the Global Cardinality Constraint","authors":"Claude-Guy Quimper, Alejandro López-Ortiz, Peter Van Beek, Alexander Golynski","year":"2004","venue":"Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Régin, 1994] Jean-Charles Régin. A Filtering Algorithm for Constraints of Difference in CSPs. In Proceedings of the 12th National Conference on Artificial Intelligence, pages 362-367, 1994.","title":"A Filtering Algorithm for Constraints of Difference in CSPs","authors":"Jean-Charles Régin","year":"1994","venue":"Proceedings of the 12th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Régin, 1995] Jean-Charles Régin. Développement d'outils algorithmiques pour l'Intelligence Artificielle. Application à la chimie organique. PhD thesis, Université Montpellier II, 1995.","title":"Développement d'outils algorithmiques pour l'Intelligence Artificielle","authors":"Jean-Charles Régin","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Régin, 1996] Jean-Charles Régin. Generalized Arc Consis- tency for Global Cardinality Constraint. In Proceedings of the 13th National Conference on Artificial Intelligence, pages 209-215, 1996.","title":"Generalized Arc Consistency for Global Cardinality Constraint","authors":"Jean-Charles Régin","year":"1996","venue":"Proceedings of the 13th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Régin, 2003] Jean-Charles Régin. Using Constraint Pro- gramming to Solve the Maximum Clique Problem. In Pro- ceedings of the 9th International Conference on Principles and Practice of Constraint Programming, pages 634-648, 2003.","title":"Using Constraint Programming to Solve the Maximum Clique Problem","authors":"Jean-Charles Régin","year":"2003","venue":"Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Sabin and Freuder, 1994] Daniel Sabin and Eugene C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Alan Borning, editor, Proceedings of the 2nd Workshop on Principles and Practice of Constraint Programming, pages 10-20, 1994.","title":"Contradicting conventional wisdom in constraint satisfaction","authors":"Daniel Sabin, Eugene C Freuder","year":"1994","venue":"Proceedings of the 2nd Workshop on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Schaus et al., 2007] Pierre Schaus, Yves Deville, and Pierre Dupont. Bound-Consistent Deviation Constraint. In Pro- ceedings of the 13th International Conference on Princi- ples and Practice of Constraint Programming, pages 620- 634, 2007.","title":"Bound-Consistent Deviation Constraint","authors":"Pierre Schaus, Yves Deville, Pierre Dupont","year":"2007","venue":"Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Simonin et al., 2012] Gilles Simonin, Christian Artigues, Emmanuel Hebrard, and Pierre Lopez. Scheduling Scien- tific Experiments on the Rosetta/Philae Mission. In Pro- ceedings of the 18th International Conference on Princi- ples and Practice of Constraint Programming, pages 23- 37, 2012.","title":"Scheduling Scientific Experiments on the Rosetta/Philae Mission","authors":"Gilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez","year":"2012","venue":"Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[van Hoeve et al., 2006] Willem-Jan van Hoeve, Gilles Pe- sant, and Louis-Martin Rousseau. On Global Warming: Flow-Based Soft Global Constraints. Journal of Heuris- tics, 12(4-5):347-373, 2006.","title":"On Global Warming: Flow-Based Soft Global Constraints","authors":"Van Hoeve","year":"2006","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Vilím, 2009] Petr Vilím. Max Energy Filtering Algorithm for Discrete Cumulative Resources. In Proceedings of the 6th International Conference on Integration of AI and OR Techniques in CP, pages 294-308, 2009.","title":"Petr Vilím. Max Energy Filtering Algorithm for Discrete Cumulative Resources","authors":"Vilím","year":"2009","venue":"Proceedings of the 6th International Conference on Integration of AI and OR Techniques in CP","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Waltz, 1975] David Waltz. Understanding Line Drawings of Scenes with Shadows. In The Psychology of Computer Vision, pages 19-91.","title":"Understanding Line Drawings of Scenes with Shadows","authors":"David Waltz","year":null,"venue":"The Psychology of Computer Vision","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}