{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:33Z","timestamp":1750219953310,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["389872375"],"award-info":[{"award-number":["389872375"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524151","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"337-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Parameterized Complexity of Learning First-Order Logic"],"prefix":"10.1145","author":[{"given":"Steffen","family":"van Bergerem","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Grohe","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ritzert","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465220"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.06.048"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043656"},{"key":"e_1_3_2_1_4_1","volume-title":"The Complexity of Reverse Engineering Problems for Conjunctive Queries. In 20th International Conference on Database Theory, ICDT 2017","volume":"17","author":"Barcel\u00f3 Pablo","year":"2017","unstructured":"Pablo Barcel\u00f3 and Miguel Romero . 2017 . The Complexity of Reverse Engineering Problems for Conjunctive Queries. In 20th International Conference on Database Theory, ICDT 2017 , March 21 --24 , 2017, Venice, Italy (LIPIcs, Vol. 68), Michael Benedikt and Giorgio Orsi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1--7: 17 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2017.7 10.4230\/LIPIcs.ICDT.2017.7 Pablo Barcel\u00f3 and Miguel Romero. 2017. The Complexity of Reverse Engineering Problems for Conjunctive Queries. In 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy (LIPIcs, Vol. 68), Michael Benedikt and Giorgio Orsi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1--7:17. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2017.7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015","author":"Bonifati Angela","year":"2015","unstructured":"Angela Bonifati , Radu Ciucanu , and Aur\u00e9lien Lemay . 2015 . Learning Path Queries on Graph Databases . In Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015 , Brussels, Belgium, March 23--27 , 2015, Gustavo Alonso, Floris Geerts, Lucian Popa, Pablo Barcel\u00f3, Jens Teubner, Mart\u00edn Ugarte, Jan Van den Bussche, and Jan Paredaens (Eds.). OpenProceedings.org, 109--120. https:\/\/doi.org\/10.5441\/002\/edbt.2015.11 10.5441\/002 Angela Bonifati, Radu Ciucanu, and Aur\u00e9lien Lemay. 2015. Learning Path Queries on Graph Databases. In Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23--27, 2015, Gustavo Alonso, Floris Geerts, Lucian Popa, Pablo Barcel\u00f3, Jens Teubner, Mart\u00edn Ugarte, Jan Van den Bussche, and Jan Paredaens (Eds.). OpenProceedings.org, 109--120. https:\/\/doi.org\/10.5441\/002\/edbt.2015.11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818637"},{"key":"e_1_3_2_1_8_1","volume-title":"Combinatorics: Topics, Techniques, Algorithms","author":"Cameron Peter J.","year":"1994","unstructured":"Peter J. Cameron . 1994 . Combinatorics: Topics, Techniques, Algorithms . Cambridge University Press . Peter J. Cameron. 1994. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89960-2_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037231"},{"key":"e_1_3_2_1_11_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R . Fellows . 2013 . Fundamentals of Parameterized Complexity. Springer . Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer."},{"volume-title":"Combinatorics, Complexity, and Logic (Proceedings of DMTCS","author":"Downey Rodney G.","key":"e_1_3_2_1_12_1","unstructured":"Rodney G. Downey , Michael R. Fellows , and Udayan Taylor . 1996. The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1] . In Combinatorics, Complexity, and Logic (Proceedings of DMTCS , Vol. 39), Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten (Eds.). Springer, 194-- 213 . Rodney G. Downey, Michael R. Fellows, and Udayan Taylor. 1996. The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. In Combinatorics, Complexity, and Logic (Proceedings of DMTCS, Vol. 39), Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten (Eds.). Springer, 194--213."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. ACM Program. Lang. 2, OOPSLA","author":"Ezudheen P.","year":"2018","unstructured":"P. Ezudheen , Daniel Neider , Deepak D'Souza , Pranav Garg , and P. Madhusudan . 2018. Horn-ICE Learning for Synthesizing Invariants and Contracts . Proc. ACM Program. Lang. 2, OOPSLA ( 2018 ), 131:1--131:25. https:\/\/doi.org\/10.1145\/3276501 10.1145\/3276501 P. Ezudheen, Daniel Neider, Deepak D'Souza, Pranav Garg, and P. Madhusudan. 2018. Horn-ICE Learning for Synthesizing Invariants and Contracts. Proc. ACM Program. Lang. 2, OOPSLA (2018), 131:1--131:25. https:\/\/doi.org\/10.1145\/3276501"},{"volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","key":"e_1_3_2_1_14_1","unstructured":"J\u00f6rg Flum and Martin Grohe . 2006. Parameterized Complexity Theory . Springer . J\u00f6rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"e_1_3_2_1_16_1","volume-title":"CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18--22, 2014. Proceedings (Lecture Notes in Computer Science","volume":"87","author":"Garg Pranav","year":"2014","unstructured":"Pranav Garg , Christof L\u00f6ding , P. Madhusudan , and Daniel Neider . 2014 . ICE: A Robust Framework for Learning Invariants. In Computer Aided Verification - 26th International Conference , CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18--22, 2014. Proceedings (Lecture Notes in Computer Science , Vol. 8559), Armin Biere and Roderick Bloem (Eds.). Springer, 69-- 87 . https:\/\/doi.org\/10.1007\/978--3--319-08867--9_5 10.1007\/978--3--319-08867--9_5 Pranav Garg, Christof L\u00f6ding, P. Madhusudan, and Daniel Neider. 2014. ICE: A Robust Framework for Learning Invariants. In Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18--22, 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8559), Armin Biere and Roderick Bloem (Eds.). Springer, 69--87. https:\/\/doi.org\/10.1007\/978--3--319-08867--9_5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837664"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667055"},{"key":"e_1_3_2_1_19_1","volume-title":"Learning Definable Hypotheses on Trees. In 22nd International Conference on Database Theory, ICDT 2019","author":"Grienenberger Emilie","year":"2019","unstructured":"Emilie Grienenberger and Martin Ritzert . 2019 . Learning Definable Hypotheses on Trees. In 22nd International Conference on Database Theory, ICDT 2019 , March 26 --28 , 2019, Lisbon, Portugal. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1--24:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.24 10.4230\/LIPIcs.ICDT.2019.24 Emilie Grienenberger and Martin Ritzert. 2019. Learning Definable Hypotheses on Trees. In 22nd International Conference on Database Theory, ICDT 2019, March 26--28, 2019, Lisbon, Portugal. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1--24:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.24"},{"key":"e_1_3_2_1_20_1","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013","volume":"40","author":"Grohe Martin","year":"2013","unstructured":"Martin Grohe , Stephan Kreutzer , and Sebastian Siebertz . 2013 . Characterisations of Nowhere Dense Graphs (Invited Talk) . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013 , December 12 --14 , 2013, Guwahati, India (LIPIcs, Vol. 24), Anil Seth and Nisheeth K. Vishnoi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 21-- 40 . https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2013.21 10.4230\/LIPIcs.FSTTCS.2013.21 Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. 2013. Characterisations of Nowhere Dense Graphs (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12--14, 2013, Guwahati, India (LIPIcs, Vol. 24), Anil Seth and Nisheeth K. Vishnoi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 21--40. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2013.21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051095"},{"key":"e_1_3_2_1_22_1","volume-title":"Learning MSO-Definable Hypotheses on Strings. In International Conference on Algorithmic Learning Theory, ALT 2017","author":"Grohe Martin","year":"2017","unstructured":"Martin Grohe , Christof L\u00f6ding , and Martin Ritzert . 2017 . Learning MSO-Definable Hypotheses on Strings. In International Conference on Algorithmic Learning Theory, ALT 2017 , 15--17 October 2017, Kyoto University, Kyoto, Japan. PMLR, 434--451. http:\/\/proceedings.mlr.press\/v76\/grohe17a.html Martin Grohe, Christof L\u00f6ding, and Martin Ritzert. 2017. Learning MSO-Definable Hypotheses on Strings. In International Conference on Algorithmic Learning Theory, ALT 2017, 15--17 October 2017, Kyoto University, Kyoto, Japan. PMLR, 434--451. http:\/\/proceedings.mlr.press\/v76\/grohe17a.html"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005080"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1112-8"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114802"},{"key":"e_1_3_2_1_26_1","first-page":"78","article-title":"Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning","volume":"100","author":"Haussler David","year":"1992","unstructured":"David Haussler . 1992 . Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications. Inf. Comput. 100 , 1 (1992), 78 -- 150 . https:\/\/doi.org\/10.1016\/0890--5401(92)90010-D 10.1016\/0890--5401(92)90010-D David Haussler. 1992. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications. Inf. Comput. 100, 1 (1992), 78--150. https:\/\/doi.org\/10.1016\/0890--5401(92)90010-D","journal-title":"Applications. Inf. Comput."},{"key":"e_1_3_2_1_27_1","volume-title":"11th International Conference, ALT 2000, Sydney, Australia, December 11--13, 2000, Proceedings (Lecture Notes in Computer Science","volume":"251","author":"Hirata Kouichi","year":"2000","unstructured":"Kouichi Hirata . 2000 . On the Hardness of Learning Acyclic Conjunctive Queries. In Algorithmic Learning Theory , 11th International Conference, ALT 2000, Sydney, Australia, December 11--13, 2000, Proceedings (Lecture Notes in Computer Science , Vol. 1968), Hiroki Arimura, Sanjay Jain, and Arun Sharma (Eds.). Springer, 238-- 251 . https:\/\/doi.org\/10.1007\/3--540--40992-0_18 10.1007\/3--540--40992-0_18 Kouichi Hirata. 2000. On the Hardness of Learning Acyclic Conjunctive Queries. In Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11--13, 2000, Proceedings (Lecture Notes in Computer Science, Vol. 1968), Hiroki Arimura, Sanjay Jain, and Arun Sharma (Eds.). Springer, 238--251. https:\/\/doi.org\/10.1007\/3--540--40992-0_18"},{"key":"e_1_3_2_1_28_1","volume-title":"Vazirani","author":"Kearns Michael J.","year":"1994","unstructured":"Michael J. Kearns and Umesh V . Vazirani . 1994 . An Introduction to Computational Learning Theory. MIT Press . https:\/\/mitpress.mit.edu\/books\/introduction- computational-learning-theory Michael J. Kearns and Umesh V. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press. https:\/\/mitpress.mit.edu\/books\/introduction- computational-learning-theory"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037089"},{"key":"e_1_3_2_1_31_1","volume-title":"Inductive Logic Programming: Theory and Methods. The Journal of Logic Programming 19--20","author":"Muggleton Stephen","year":"1994","unstructured":"Stephen Muggleton and Luc De Raedt . 1994. Inductive Logic Programming: Theory and Methods. The Journal of Logic Programming 19--20 ( 1994 ), 629--679. Stephen Muggleton and Luc De Raedt. 1994. Inductive Logic Programming: Theory and Methods. The Journal of Logic Programming 19--20 (1994), 629--679."},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016","author":"Padhi Saswat","year":"2016","unstructured":"Saswat Padhi , Rahul Sharma , and Todd D. Millstein . 2016. Data-driven Precondition Inference with Learned Features . In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016 , Santa Barbara, CA, USA, June 13--17 , 2016 , Chandra Krintz and Emery Berger (Eds.). ACM, 42--56. https:\/\/doi.org\/10.1145\/2908080.2908099 10.1145\/2908080.2908099 Saswat Padhi, Rahul Sharma, and Todd D. Millstein. 2016. Data-driven Precondition Inference with Learned Features. In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, Santa Barbara, CA, USA, June 13--17, 2016, Chandra Krintz and Emery Berger (Eds.). ACM, 42--56. https:\/\/doi.org\/10.1145\/2908080.2908099"},{"volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"Shalev-Shwartz Shai","key":"e_1_3_2_1_33_1","unstructured":"Shai Shalev-Shwartz and Shai Ben-David . 2014. Understanding Machine Learning: From Theory to Algorithms . Cambridge University Press , New York, NY, USA . Shai Shalev-Shwartz and Shai Ben-David. 2014. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York, NY, USA."},{"key":"e_1_3_2_1_34_1","volume-title":"Learning Twig and Path Queries. In 15th International Conference on Database Theory, ICDT '12","author":"Staworko Slawek","year":"2012","unstructured":"Slawek Staworko and Piotr Wieczorek . 2012 . Learning Twig and Path Queries. In 15th International Conference on Database Theory, ICDT '12 , Berlin, Germany, March 26--29 , 2012, Alin Deutsch (Ed.). ACM, 140--154. https:\/\/doi.org\/10.1145\/2274576.2274592 10.1145\/2274576.2274592 Slawek Staworko and Piotr Wieczorek. 2012. Learning Twig and Path Queries. In 15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26--29, 2012, Alin Deutsch (Ed.). ACM, 140--154. https:\/\/doi.org\/10.1145\/2274576.2274592"},{"key":"e_1_3_2_1_35_1","volume-title":"Conjunctive Queries: Unique Characterizations and Exact Learnability. In 24th International Conference on Database Theory (ICDT 2021) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"24","author":"Cate Balder","year":"2021","unstructured":"Balder ten Cate and V\u00edctor Dalmau . 2021 . Conjunctive Queries: Unique Characterizations and Exact Learnability. In 24th International Conference on Database Theory (ICDT 2021) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 186), Ke Yi and Zhewei Wei (Eds.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 9:1--9: 24 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.9 10.4230\/LIPIcs.ICDT.2021.9 Balder ten Cate and V\u00edctor Dalmau. 2021. Conjunctive Queries: Unique Characterizations and Exact Learnability. In 24th International Conference on Database Theory (ICDT 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 186), Ke Yi and Zhewei Wei (Eds.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 9:1--9:24. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2539032.2539035"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2539032.2539035"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196974"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_40_1","volume-title":"Learning Concepts Definable in First-Order Logic with Counting. In 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019","author":"van Bergerem Steffen","year":"2019","unstructured":"Steffen van Bergerem . 2019 . Learning Concepts Definable in First-Order Logic with Counting. In 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019 , Vancouver, BC, Canada, June 24--27 , 2019. IEEE, 1--13. https:\/\/doi.org\/10.1109\/LICS.2019.8785811 10.1109\/LICS.2019.8785811 Steffen van Bergerem. 2019. Learning Concepts Definable in First-Order Logic with Counting. In 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24--27, 2019. IEEE, 1--13. https:\/\/doi.org\/10.1109\/LICS.2019.8785811"},{"key":"e_1_3_2_1_41_1","volume-title":"On the Parameter- ized Complexity of Learning Logic. CoRR abs\/2102.12201","author":"van Bergerem Steffen","year":"2021","unstructured":"Steffen van Bergerem , Martin Grohe , and Martin Ritzert . 2021. On the Parameter- ized Complexity of Learning Logic. CoRR abs\/2102.12201 ( 2021 ). arXiv:2102.12201 https:\/\/arxiv.org\/abs\/2102.12201 Steffen van Bergerem, Martin Grohe, and Martin Ritzert. 2021. On the Parameter- ized Complexity of Learning Logic. CoRR abs\/2102.12201 (2021). arXiv:2102.12201 https:\/\/arxiv.org\/abs\/2102.12201"},{"key":"e_1_3_2_1_42_1","volume-title":"Learning Concepts Described By Weight Aggregation Logic. In 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25--28, 2021, Ljubljana, Slovenia (Virtual Conference) (LIPIcs","volume":"18","author":"van Bergerem Steffen","year":"2021","unstructured":"Steffen van Bergerem and Nicole Schweikardt . 2021 . Learning Concepts Described By Weight Aggregation Logic. In 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25--28, 2021, Ljubljana, Slovenia (Virtual Conference) (LIPIcs , Vol. 183), Christel Baier and Jean Goubault-Larrecq (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 10:1--10: 18 . https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.10 10.4230\/LIPIcs.CSL.2021.10 Steffen van Bergerem and Nicole Schweikardt. 2021. Learning Concepts Described By Weight Aggregation Logic. In 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25--28, 2021, Ljubljana, Slovenia (Virtual Conference) (LIPIcs, Vol. 183), Christel Baier and Jean Goubault-Larrecq (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 10:1--10:18. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.10"},{"key":"e_1_3_2_1_43_1","volume-title":"On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications 16","author":"Vapnik Vladimir","year":"1971","unstructured":"Vladimir Vapnik and Alexey Ya. Chervonenkis . 1971. On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications 16 ( 1971 ), 264--280. Vladimir Vapnik and Alexey Ya. Chervonenkis. 1971. On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications 16 (1971), 264--280."},{"key":"e_1_3_2_1_44_1","volume-title":"CP 2010, St. Andrews, Scotland, UK, September 6--10, 2010. Proceedings (Lecture Notes in Computer Science","volume":"23","author":"Willard Ross","year":"2010","unstructured":"Ross Willard . 2010 . Testing Expressibility Is Hard. In Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference , CP 2010, St. Andrews, Scotland, UK, September 6--10, 2010. Proceedings (Lecture Notes in Computer Science , Vol. 6308), David Cohen (Ed.). Springer, 9-- 23 . https:\/\/doi.org\/10.1007\/978--3--642--15396--9_4 10.1007\/978--3--642--15396--9_4 Ross Willard. 2010. Testing Expressibility Is Hard. In Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6--10, 2010. Proceedings (Lecture Notes in Computer Science, Vol. 6308), David Cohen (Ed.). Springer, 9--23. https:\/\/doi.org\/10.1007\/978--3--642--15396--9_4"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192416"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524151","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":45,"alternative-id":["10.1145\/3517804.3524151","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524151","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}