{"type":"ScholarlyArticle","title":"Automatic Synthesis of Smart Table Constraints by Abstraction of Table Constraints","authors":[{"name":"Baudouin Le Charlier","slug":"baudouin-le-charlier","given":"Baudouin","family":"Le Charlier","affiliation":"Université catholique de Louvain , Belgium"},{"name":"Minh Thanh Khong","slug":"minh-thanh-khong","given":"Minh Thanh","family":"Khong","affiliation":"Université catholique de Louvain , Belgium"},{"name":"Christophe Lecoutre","slug":"christophe-lecoutre","given":"Christophe","family":"Lecoutre","affiliation":"CRIL-CNRS , Université d'Artois , France"},{"name":"Yves Deville","slug":"yves-deville","given":"Yves","family":"Deville","affiliation":"Université catholique de Louvain , Belgium"}],"abstract":"The smart table constraint represents a powerful modeling tool that has been recently introduced. This constraint allows the user to represent compactly a number of well-known (global) constraints and more generally any arbitrarily structured constraints, especially when disjunction is at stake. In many problems, some constraints are given under the basic and simple form of tables explicitly listing the allowed combinations of values. In this paper, we propose an algorithm to convert automatically any (ordinary) table into a compact smart table. Its theoretical time complexity is shown to be quadratic in the size of the input table. Experimental results demonstrate its compression efficiency on many constraint cases while showing its reasonable execution time. It is then shown that using filtering algorithms on the resulting smart table is more efficient than using state of the art filtering algorithms on the initial table.","doi":"10.24963/ijcai.2017/95","url":"https://ijcai.org/proceedings/2017/95","pdf":"https://ijcai.org/proceedings/2017/0095.pdf","markdown":"https://ijcai.org/proceedings/2017/95.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/95","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":95,"pages":{"first":681,"last":687},"keywords":["Combinatorial & Heuristic Search: Heuristic Search","Constraints and Satisfiability: Constraint Satisfaction","Constraints and Satisfiability: Global Constraints"],"videos":[],"references":[{"position":1,"raw":"[Bacchus and Walsh, 2005] Fahiem Bacchus and Toby Walsh. Propagating logical combinations of constraints. In Proceedings of IJCAI'05, pages 35-40, 2005.","title":"Fahiem Bacchus and Toby Walsh. Propagating logical combinations of constraints","authors":"Walsh Bacchus","year":"2005","venue":"Proceedings of IJCAI'05","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Beldiceanu et al., 2014] Nicolas Beldiceanu, Mats Carls- son, and Jean-Xavier Rampon. Global constraint catalog. Technical Report T2012:03, TASC-SICS-LINA, 2014.","title":"Global constraint catalog","authors":"Beldiceanu","year":"2014","venue":"Nicolas Beldiceanu","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Carlson and Carlsson, 1995] Björn Carlson and Mats Carls- son. Compiling and executing disjunctions of finite do- main constraints. In Proceedings of ICLP'95, pages 117- 131, 1995.","title":"Compiling and executing disjunctions of finite domain constraints","authors":"Carlsson Carlson, Björn Carlson, Mats Carlsson","year":"1995","venue":"Proceedings of ICLP'95","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cheng and Yap, 2010] Kenil C. K. Cheng and Roland H. C. Yap. An MDD-based generalized arc consistency algo- rithm for positive and negative table constraints and some global constraints. Constraints, 15(2):265-304, 2010.","title":"An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints","authors":"C K Kenil, Roland H C Cheng, Yap","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cousot and Cousot, 1977] Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice for static analysis of programs by construction of approximation of fixpoints. In Proceedings of POPL'77, pages 238-252, 1977.","title":"Abstract interpretation: a unified lattice for static analysis of programs by construction of approximation of fixpoints","authors":"Cousot Cousot, Patrick Cousot, Radhia Cousot","year":"1977","venue":"Proceedings of POPL'77","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Demeulenaere et al., 2016] Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, and Pierre Schaus. Efficiently filtering table constraints with reversible sparse bit-sets. In Proceedings of CP'16, pages 207-223, 2016.","title":"Efficiently filtering table constraints with reversible sparse bit-sets","authors":"Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus","year":"2016","venue":"Proceedings of CP'16","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gent et al., 2007] Ian P. Gent, Christopher Jefferson, Ian Miguel, and Peter Nightingale. Data structures for gener- alised arc consistency for extensional constraints. In Pro- ceedings of AAAI'07, pages 191-197, 2007.","title":"Data structures for generalised arc consistency for extensional constraints","authors":"Ian P Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale","year":"2007","venue":"Proceedings of AAAI'07","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hentenryck et al., 1998] Pascal Van Hentenryck, Vijay A. Saraswat, and Yves Deville. Design, implementation and evaluation of the constraint language cc(FD). Journal of Logic Programming, 37(1-3):139-164, 1998.","title":"Design, implementation and evaluation of the constraint language cc(FD)","authors":"Pascal Van Hentenryck, Vijay A Saraswat, Yves Deville","year":"1998","venue":"Journal of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Jefferson and Nightingale, 2013] Christopher Jefferson and Peter Nightingale. Extending simple tabular reduction with short supports. In Proceedings of IJCAI'13, pages 573-579, 2013.","title":"Christopher Jefferson and Peter Nightingale. Extending simple tabular reduction with short supports","authors":"Nightingale Jefferson","year":"2013","venue":"Proceedings of IJCAI'13","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Jefferson et al., 2010] Christopher Jefferson, Neil C. A. Moore, Peter Nightingale, and Karen E. Petrie. Imple- menting logical connectives in constraint programming. Artificial Intelligence, 174(16):1407-1429, 2010.","title":"Implementing logical connectives in constraint programming","authors":"Christopher Jefferson, C A Neil, Peter Moore, Karen E Nightingale, Petrie","year":"2010","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Katsirelos and Walsh, 2007] George Katsirelos and Toby Walsh. A compression algorithm for large arity exten- sional constraints. In Proceedings of CP'07, pages 379- 393, 2007.","title":"A compression algorithm for large arity extensional constraints","authors":"Walsh ; Katsirelos, George Katsirelos, Toby Walsh","year":"2007","venue":"Proceedings of CP'07","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lecoutre and Szymanek, 2006] Christophe Lecoutre and Radoslaw Szymanek. Generalized arc consistency for pos- itive table constraints. In Proceedings of CP'06, pages 284-298, 2006.","title":"Generalized arc consistency for positive table constraints","authors":"Christophe Lecoutre, Radoslaw Szymanek","year":"2006","venue":"Proceedings of CP'06","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lecoutre et al., 2012] Christophe Lecoutre, Chavalit Likit- vivatanavong, and Roland H. C. Yap. A path-optimal GAC algorithm for table constraints. In Proceedings of ECAI'12, pages 510-515, 2012.","title":"A path-optimal GAC algorithm for table constraints","authors":"Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H C Yap","year":"2012","venue":"Proceedings of ECAI'12","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lecoutre, 2011] Christophe Lecoutre. STR2: Optimized simple tabular reduction for table constraints. Constraints, 16(4):341-371, 2011.","title":"Christophe Lecoutre. STR2: Optimized simple tabular reduction for table constraints","authors":"Lecoutre","year":"2011","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lhomme and Régin, 2005] Olivier Lhomme and Jean- Charles Régin. A fast arc consistency algorithm for n-ary constraints. In Proceedings of AAAI'05, pages 405-410, 2005.","title":"A fast arc consistency algorithm for n-ary constraints","authors":"Régin Lhomme, Olivier Lhomme, Jean-Charles Régin","year":"2005","venue":"Proceedings of AAAI'05","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lhomme, 2004] Olivier Lhomme. Arc-consistency filtering algorithms for logical combinations of constraints. In Pro- ceedings of CPAIOR'04, pages 209-224, 2004.","title":"Arc-consistency filtering algorithms for logical combinations of constraints","authors":"Olivier Lhomme, Lhomme","year":"2004","venue":"Proceedings of CPAIOR'04","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lhomme, 2012] Olivier Lhomme. Practical reformulations with table constraints. In Proceedings of ECAI'12, pages 911-912, 2012.","title":"Practical reformulations with table constraints","authors":"Olivier Lhomme, Lhomme","year":"2012","venue":"Proceedings of ECAI'12","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mairy et al., 2012] Jean-Baptiste Mairy, Pascal Van Hen- tenryck, and Yves Deville. An optimal filtering algorithm for table constraints. In Proceedings of CP'12, pages 496- 511, 2012.","title":"An optimal filtering algorithm for table constraints","authors":"Mairy","year":"2012","venue":"Proceedings of CP'12","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mairy et al., 2015] Jean-Baptiste Mairy, Yves Deville, and Christophe Lecoutre. The smart table constraint. In Pro- ceedings of CPAIOR'15, pages 271-287, 2015.","title":"The smart table constraint","authors":"Mairy","year":"2015","venue":"Proceedings of CPAIOR'15","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Montanari, 1974] Ugo Montanari. Network of constraints : Fundamental properties and applications to picture pro- cessing. Information Science, 7:95-132, 1974.","title":"Network of constraints : Fundamental properties and applications to picture processing","authors":"Ugo Montanari","year":"1974","venue":"Information Science","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Nightingale et al., 2011] Peter Nightingale, Ian P. Gent, Christopher Jefferson, and Ian Miguel. Exploiting short supports for generalised arc consistency for arbitrary con- straints. In Proceedings of IJCAI'11, pages 623-628, 2011.","title":"Exploiting short supports for generalised arc consistency for arbitrary constraints","authors":"Peter Nightingale, Ian P Gent, Christopher Jefferson, Ian Miguel","year":"2011","venue":"Proceedings of IJCAI'11","doi":null,"url":null,"internal_url":"/proceedings/2011/111"},{"position":22,"raw":"[Perez and Régin, 2014] Guillaume Perez and Jean-Charles Régin. Improving GAC-4 for Table and MDD constraints. In Proceedings of CP'14, pages 606-621, 2014.","title":"Improving GAC-4 for Table and MDD constraints","authors":"Régin Perez, Guillaume Perez, Jean-Charles Régin","year":"2014","venue":"Proceedings of CP'14","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Régin, 2011] Jean-Charles Régin. Improving the expres- siveness of table constraints. In Proceedings of the work- shop ModRef'11 held with CP'11, 2011.","title":"Improving the expressiveness of table constraints","authors":"Jean-Charles Régin","year":"2011","venue":"Proceedings of the workshop ModRef'11 held with CP'11","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Srinivasan et al., 1990] Arvind Srinivasan, Timothy Kam, Sharad Malik, and Robert K. Brayton. Algorithms for dis- crete function manipulation. In Proceedings of ICCAD'90, pages 92-95, 1990.","title":"Algorithms for discrete function manipulation","authors":"Arvind Srinivasan, Timothy Kam, Sharad Malik, Robert K Brayton","year":"1990","venue":"Proceedings of ICCAD'90","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ullmann, 2007] Julian R. Ullmann. Partition search for non-binary constraint satisfaction. Information Science, 177:3639-3678, 2007.","title":"Partition search for non-binary constraint satisfaction","authors":"Julian R Ullmann","year":"2007","venue":"Information Science","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Verhaeghe et al., 2017] Hélène Verhaeghe, Christophe Lecoutre, and Pierre Schaus. Extending compact-table to negative and short tables. In Proceedings of AAAI'17, pages 3951-3957, 2017.","title":"Extending compact-table to negative and short tables","authors":"Hélène Verhaeghe, Christophe Lecoutre, Pierre Schaus","year":"2017","venue":"Proceedings of AAAI'17","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wang et al., 2016] Ruiwei Wang, Wei Xia, Roland H. C. Yap, and Zhanshan Li. Optimizing Simple Tabular Re- duction with a bitwise representation. In Proceedings of IJCAI'16, pages 787-795, 2016.","title":"Optimizing Simple Tabular Reduction with a bitwise representation","authors":"Ruiwei Wang, Wei Xia, H C Roland, Zhanshan Yap, Li","year":"2016","venue":"Proceedings of IJCAI'16","doi":null,"url":null,"internal_url":"/proceedings/2016/117"},{"position":28,"raw":"[Xia and Yap, 2013] Wei Xia and Roland H. C. Yap. Opti- mizing STR algorithms with tuple compression. In Pro- ceedings of CP'13, pages 724-732, 2013.","title":"Optimizing STR algorithms with tuple compression","authors":"Wei Xia, H C Roland, Yap","year":"2013","venue":"Proceedings of CP'13","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}