{"type":"ScholarlyArticle","title":"On Discovering Interesting Combinatorial Integer Sequences","authors":[{"name":"Martin Svatoš","slug":"martin-svatos","given":"Martin","family":"Svatos","affiliation":"Faculty of Electrical Engineering , Czech Technical University in Prague , Czech Republic"},{"name":"Peter Jung","slug":"peter-jung","given":"Peter","family":"Jung","affiliation":"Faculty of Electrical Engineering , Czech Technical University in Prague , Czech Republic"},{"name":"Jan Tóth","slug":"jan-toth","given":"Jan","family":"Tóth","affiliation":"Faculty of Electrical Engineering , Czech Technical University in Prague , Czech Republic"},{"name":"Yuyi Wang","slug":"yuyi-wang","given":"Yuyi","family":"Wang","affiliation":"CRRC Zhuzhou Institute , China; ETH Zurich , Switzerland"},{"name":"Ondřej Kuželka","slug":"ondrej-kuzelka","given":"Ondrej","family":"Kuzelka","affiliation":"Faculty of Electrical Engineering , Czech Technical University in Prague , Czech Republic"}],"abstract":"We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial objects, e.g., undirected graphs, permutations, matchings etc. In the second step, we use algorithms for lifted first-order model counting to generate integer sequences that count the objects encoded by the first-order logic formulas generated in the first step. For instance, if the first-order sentence defines permutations then the generated integer sequence is the sequence of factorial numbers n!. We demonstrate that our approach is able to generate interesting new sequences by showing that a non-negligible fraction of the automatically generated sequences can actually be found in the Online Encyclopaedia of Integer Sequences (OEIS) while generating many other similar sequences which are not present in OEIS and which are potentially interesting. A key technical contribution of our work is the method for generation of first-order logic sentences which is able to drastically prune the space of sentences by discarding large fraction of sentences which would lead to redundant integer sequences.","doi":"10.24963/ijcai.2023/372","url":"https://ijcai.org/proceedings/2023/372","pdf":"https://ijcai.org/proceedings/2023/0372.pdf","markdown":"https://ijcai.org/proceedings/2023/372.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/372","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":372,"pages":{"first":3338,"last":3346},"keywords":["Knowledge Representation and Reasoning: KRR: Other"],"videos":[],"references":[{"position":1,"raw":"[Albert et al., 2022] Michael H. Albert, Christian Bean, An- ders Claesson, Émile Nadeau, Jay Pantone, and Henning Ulfarsson. Combinatorial Exploration: An algorithmic framework for enumeration. https://arxiv.org/abs/2202. 07715, 2022.","title":"Combinatorial Exploration: An algorithmic framework for enumeration","authors":"H Michael, Christian Albert, Anders Bean, Émile Claesson, Jay Nadeau, Henning Pantone, Ulfarsson","year":null,"venue":null,"doi":null,"url":"https://arxiv.org/abs/2202.07715,2022","internal_url":null},{"position":2,"raw":"[Barvínek et al., 2021] Jáchym Barvínek, Timothy van Bre- men, Yuyi Wang, Filip Zelezný, and Ondrej Kuzelka. Au- tomatic conjecturing of p-recursions using lifted inference. In Nikos Katzouris and Alexander Artikis, editors, Induc- tive Logic Programming -30th International Conference, ILP 2021, Proceedings, volume 13191 of Lecture Notes in Computer Science, pages 17-25. Springer, 2021.","title":"Automatic conjecturing of p-recursions using lifted inference","authors":"Barvínek","year":"2021","venue":"Inductive Logic Programming -30th International Conference, ILP 2021, Proceedings","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Beame et al., 2015] Paul Beame, Guy Van den Broeck, Eric Gribkoff, and Dan Suciu. Symmetric weighted first-order model counting. In Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '15, page 313-328, New York, NY, USA, 2015. Association for Computing Ma- chinery.","title":"Symmetric weighted first-order model counting","authors":"Paul Beame, Guy Van Den, Eric Broeck, Dan Gribkoff, Suciu","year":"2015","venue":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '15","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Börger et al., 2001] Egon Börger, Erich Grädel, and Yuri Gurevich. The classical decision problem, page 48. Springer Science & Business Media, 2001.","title":"The classical decision problem","authors":"Börger","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Colton, 2002] Simon Colton. The hr program for theorem generation. In International Conference on Automated De- duction, pages 285-289. Springer, 2002.","title":"The hr program for theorem generation","authors":"Colton ;, Simon Colton","year":"2002","venue":"International Conference on Automated Deduction","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Davies et al., 2021] Alex Davies, Petar Veličković, Lars Buesing, Sam Blackwell, Daniel Zheng, Nenad Tomašev, Richard Tanburn, Peter Battaglia, Charles Blundell, András Juhász, et al. Advancing mathematics by guiding human intuition with ai. Nature, 600(7887):70-74, 2021.","title":"Advancing mathematics by guiding human intuition with ai","authors":"Alex Davies, Petar Veličković, Lars Buesing, Sam Blackwell, Daniel Zheng, Nenad Tomašev, Richard Tanburn, Peter Battaglia, Charles Blundell, András Juhász","year":"2021","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gogate and Domingos, 2011] Vibhav Gogate and Pedro M. Domingos. Probabilistic theorem proving. In Fábio Gagliardi Cozman and Avi Pfeffer, editors, UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14-17, 2011, pages 256-265. AUAI Press, 2011.","title":"Probabilistic theorem proving","authors":"Vibhav Gogate, Pedro M Domingos","year":"2011","venue":"UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Grädel and Otto, 1999] Erich Grädel and Martin Otto. On logics with two variables. Theoretical computer science, 224(1-2):73-113, 1999.","title":"Erich Grädel and Martin Otto. On logics with two variables","authors":"Otto Grädel","year":"1999","venue":"Theoretical computer science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hinrichs and Genesereth, 2006] Timothy Hinrichs and Michael Genesereth. Herbrand logic. Technical Report LG-2006-02, Stanford University, Stanford, CA, 2006. http://logic.stanford.edu/reports/LG-2006-02.pdf.","title":"Herbrand logic","authors":"Timothy Hinrichs, Michael Genesereth","year":"2006","venue":null,"doi":null,"url":"http://logic.stanford.edu/reports/LG-2006-02.pdf","internal_url":null},{"position":10,"raw":"[Kuželka, 2021] Ondřej Kuželka. Weighted first-order model counting in the two-variable fragment with count- ing quantifiers. Journal of Artificial Intelligence Research, 70:1281-1307, 2021.","title":"Weighted first-order model counting in the two-variable fragment with counting quantifiers","authors":"Ondřej Kuželka, Kuželka","year":"2021","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Nijssen and Kok, 2001] Siegfried Nijssen and Joost N. Kok. Faster association rules for multiple relations. In Bern- hard Nebel, editor, Proceedings of the Seventeenth Inter- national Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001, pages 891-896.","title":"Faster association rules for multiple relations","authors":"Kok ; ] Nijssen, Siegfried Nijssen, Joost N Kok","year":"2001","venue":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001","doi":null,"url":null,"internal_url":"/proceedings/2001/122"},{"position":12,"raw":"Morgan Kaufmann, 2001.","title":null,"authors":"Morgan Kaufmann","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[OEIS Foundation Inc., 2023] OEIS Foundation Inc. The on-line encyclopedia of integer sequences. Published elec- tronically at http://oeis.org, 2023. Accessed: 2023-05-23.","title":"The on-line encyclopedia of integer sequences","authors":null,"year":"2023","venue":null,"doi":null,"url":"http://oeis.org,2023","internal_url":null},{"position":14,"raw":"[Pak, 2018] Igor Pak. Complexity problems in enumera- tive combinatorics. In Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018, pages 3153-3180. World Scientific, 2018.","title":"Igor Pak. Complexity problems in enumerative combinatorics","authors":"Pak","year":"2018","venue":"Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Poole, 2003] David Poole. First-order probabilistic infer- ence. In Georg Gottlob and Toby Walsh, editors, IJCAI-03, Proceedings of the Eighteenth International Joint Confer- ence on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pages 985-991.","title":"First-order probabilistic inference","authors":"David Poole","year":"2003","venue":"IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2003/141"},{"position":16,"raw":"Morgan Kaufmann, 2003.","title":null,"authors":"Morgan Kaufmann","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pratt-Hartmann, 2009] Ian Pratt-Hartmann. Data- complexity of the two-variable fragment with counting quantifiers. Information and Computation, 207(8):867- 888, 2009.","title":"Datacomplexity of the two-variable fragment with counting quantifiers","authors":"Ian Pratt-Hartmann","year":"2009","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Stanley, 1986] Richard P Stanley. What is enumerative combinatorics? In Enumerative combinatorics, pages 1- 63. Springer, 1986.","title":"What is enumerative combinatorics?","authors":"P Richard, Stanley","year":"1986","venue":"Enumerative combinatorics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Suster et al., 2021] Simon Suster, Pieter Fivez, Pietro Totis, Angelika Kimmig, Jesse Davis, Luc De Raedt, and Walter Daelemans. Mapping probability word problems to exe- cutable representations. In Proceedings of the 2021 Con- ference on Empirical Methods in Natural Language Pro- cessing, pages 3627-3640, 2021.","title":"Mapping probability word problems to executable representations","authors":"Simon Suster, Pieter Fivez, Pietro Totis, Angelika Kimmig, Jesse Davis, Luc De Raedt, Walter Daelemans","year":"2021","venue":"Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Totis et al., 2023] Pietro Totis, Jesse Davis, Luc De Raedt, and Angelika Kimmig. Lifted reasoning for combinato- rial counting. Journal of Artificial Intelligence Research, 76:1-58, 2023.","title":"Lifted reasoning for combinatorial counting","authors":"Pietro Totis, Jesse Davis, Luc De Raedt, Angelika Kimmig","year":"2023","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[van Bremen and Kuželka, 2021] Timothy van Bremen and Ondřej Kuželka. Faster lifting for two-variable logic using cell graphs. In Proceedings of the Thirty-Seventh Con- ference on Uncertainty in Artificial Intelligence, volume 161 of Proceedings of Machine Learning Research, pages 1393-1402. PMLR, 27-30 Jul 2021.","title":"Faster lifting for two-variable logic using cell graphs","authors":"Kuželka ; Timothy Van Bremen, Ondřej Van Bremen, Kuželka","year":"2021","venue":"Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[van Bremen et al., 2021] Timothy van Bremen, Vincent Derkinderen, Shubham Sharma, Subhajit Roy, and Kuldeep S. Meel. Symmetric component caching for model counting on combinatorial instances. In Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3922- 3930. AAAI Press, 2021.","title":"Symmetric component caching for model counting on combinatorial instances","authors":"Van Bremen","year":"2021","venue":"Thirty-Fifth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Van den Broeck et al., 2011] Guy Van den Broeck, Nima Taghipour, Wannes Meert, Jesse Davis, and Luc De Raedt. Lifted probabilistic inference by first-order knowledge compilation. In Toby Walsh, editor, Proceedings of the Twenty-Second International Joint Conference on Ar- tificial Intelligence (IJCAI), pages 2178-2185. AAAI Press/International Joint Conferences on Artificial Intelli- gence, 2011.","title":"Lifted probabilistic inference by first-order knowledge compilation","authors":"Broeck Van Den","year":"2011","venue":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2011/363"},{"position":24,"raw":"[Van den Broeck et al., 2014] Guy Van den Broeck, Wannes Meert, and Adnan Darwiche. Skolemization for weighted first-order model counting. In Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR'14, page 111-120. AAAI Press, 2014.","title":"Skolemization for weighted first-order model counting","authors":"Broeck Van Den","year":"2014","venue":"Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR'14","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Van den Broeck, 2011] Guy Van den Broeck. On the com- pleteness of first-order knowledge compilation for lifted probabilistic inference. In Proceedings of the 24th Interna- tional Conference on Neural Information Processing Sys- tems, NIPS'11, page 1386-1394, Red Hook, NY, USA, 2011.","title":"On the completeness of first-order knowledge compilation for lifted probabilistic inference","authors":"Broeck ; Van Den, Guy Van Den Broeck","year":"2011","venue":"Proceedings of the 24th International Conference on Neural Information Processing Systems, NIPS'11","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}