skip to main content
research-article
Open Access
Distinguished Paper

Learning formulas in finite variable logics

Published:12 January 2022Publication History
Skip Abstract Section

Abstract

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that classify a set of positively- and negatively-labeled structures. We give algorithms for realizability and synthesis of such formulas along with upper and lower bounds. We also establish positive results using our technique for other logics and variants of the learning problem, including first-order logic with least fixed point definitions, higher-order logics, and synthesis of queries and terms with recursively-defined functions.

Skip Supplemental Material Section

Supplemental Material

Auxiliary Presentation Video

Video advertisement for the talk "Learning Formulas in Finite Variable Logics" at POPL 2022. Abstract: We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that classify a set of positively- and negatively-labeled structures. We give algorithms for realizability and synthesis of such formulas along with upper and lower bounds. We also establish positive results using our technique for other logics and variants of the learning problem, including first-order logic with least fixed point definitions, higher-order logics, and synthesis of queries and terms with recursively-defined functions.

References

  1. Aws Albarghouthi, Paraschos Koutris, Mayur Naik, and Calvin Smith. 2017. Constraint-Based Synthesis of Datalog Programs. In Principles and Practice of Constraint Programming, J. Christopher Beck (Ed.). Springer International Publishing, Cham. 689–706. isbn:978-3-319-66158-2 https://doi.org/10.1007/978-3-319-66158-2_44 Google ScholarGoogle ScholarCross RefCross Ref
  2. Rajeev Alur, Rastislav Bodík, Eric Dallal, Dana Fisman, Pranav Garg, Garvit Juniwal, Hadas Kress-Gazit, P. Madhusudan, Milo M. K. Martin, Mukund Raghothaman, Shambwaditya Saha, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. 2015. Syntax-Guided Synthesis. In Dependable Software Systems Engineering (NATO Science for Peace and Security Series, D: Information and Communication Security, Vol. 40). IOS Press, 1–25.Google ScholarGoogle Scholar
  3. Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, and Yaniv Sa’ar. 2012. Synthesis of Reactive(1) designs. J. Comput. System Sci., 78, 3 (2012), 911–938. issn:0022-0000 https://doi.org/10.1016/j.jcss.2011.08.007 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Richard Buchi and Lawrence H. Landweber. 1969. Solving Sequential Conditions by Finite-State Strategies. Trans. Amer. Math. Soc., 138 (1969), 295–311. issn:00029947 http://www.jstor.org/stable/1994916Google ScholarGoogle ScholarCross RefCross Ref
  5. Benjamin Caulfield, Markus N. Rabe, Sanjit A. Seshia, and Stavros Tripakis. 2015. What’s Decidable about Syntax-Guided Synthesis? CoRR, abs/1510.08393 (2015), arxiv:1510.08393Google ScholarGoogle Scholar
  6. Alvin Cheung, Armando Solar-Lezama, and Samuel Madden. 2013. Optimizing Database-Backed Applications with Query Synthesis. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’13). Association for Computing Machinery, New York, NY, USA. 3–14. isbn:9781450320146 https://doi.org/10.1145/2491956.2462180 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Alonzo Church. 1960. Application of recursive arithmetic to the problem of circuit synthesis. Summaries of talks presented at the Summer Institute for Symbolic Logic Cornell University, 1957, 2nd edn., Journal of Symbolic Logic, 28, 4 (1960), 30–50. 3a–45a..Google ScholarGoogle Scholar
  8. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. 2007. Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata. release October, 12th 2007.Google ScholarGoogle Scholar
  9. Andrew Cropper, Sebastijan Dumancic, and Stephen H. Muggleton. 2020. Turning 30: New Ideas in Inductive Logic Programming. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, Christian Bessiere (Ed.). ijcai.org, 4833–4839. https://doi.org/10.24963/ijcai.2020/673 Google ScholarGoogle ScholarCross RefCross Ref
  10. Ugo Dal Lago. 2012. A Short Introduction to Implicit Computational Complexity. Springer Berlin Heidelberg, Berlin, Heidelberg. 89–109. isbn:978-3-642-31485-8 https://doi.org/10.1007/978-3-642-31485-8_3 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Andrzej Ehrenfeucht. 1961. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49, 2 (1961), 129–141. http://eudml.org/doc/213582Google ScholarGoogle ScholarCross RefCross Ref
  12. Herbert B. Enderton. 2001. Chapter 2 - First-Order Logic. In A Mathematical Introduction to Logic (second edition ed.), Herbert B. Enderton (Ed.). Academic Press, Boston. 67–181. isbn:978-0-12-238452-3 https://doi.org/10.1016/B978-0-08-049646-7.50008-4 Google ScholarGoogle ScholarCross RefCross Ref
  13. Richard Evans and Edward Grefenstette. 2018. Learning Explanatory Rules from Noisy Data. J. Artif. Int. Res., 61, 1 (2018), Jan., 1–64. issn:1076-9757 https://dl.acm.org/doi/10.5555/3241691.3241692Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. John K. Feser, Swarat Chaudhuri, and Isil Dillig. 2015. Synthesizing Data Structure Transformations from Input-Output Examples. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’15). Association for Computing Machinery, New York, NY, USA. 229–239. isbn:9781450334686 https://doi.org/10.1145/2737924.2737977 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Flum and M. Grohe. 2006. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag, Berlin, Heidelberg. isbn:3540299521 https://doi.org/10.1007/3-540-29953-X Google ScholarGoogle ScholarCross RefCross Ref
  16. Roland Fraïssé. 1953. Sur quelques classifications des systèmes de relations. Ph.D. Dissertation. Publications Scientifiques de l’Université d’Alger, series A 1 (1954).Google ScholarGoogle Scholar
  17. Carsten Fritz. 2002. Some Fixed Point Basics. Springer Berlin Heidelberg, Berlin, Heidelberg. 359–364. isbn:978-3-540-36387-3 https://doi.org/10.1007/3-540-36387-4_20 Google ScholarGoogle ScholarCross RefCross Ref
  18. Maurice Funk, Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini, and Frank Wolter. 2019. Learning Description Logic Concepts: When can Positive and Negative Examples be Separated? In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19. International Joint Conferences on Artificial Intelligence Organization, 1682–1688. https://doi.org/10.24963/ijcai.2019/233 Google ScholarGoogle ScholarCross RefCross Ref
  19. Pranav Garg, Christof Löding, P. Madhusudan, and Daniel Neider. 2015. Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists. Formal Methods in System Design, 47, 1 (2015), 01 Aug, 120–157. issn:1572-8102 https://doi.org/10.1007/s10703-015-0231-6 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 2002. Automata Logics, and Infinite Games: A Guide to Current Research, Erich Grädel, Wolfgang Thomas, and Thomas Wilke (Eds.). Springer-Verlag, Berlin, Heidelberg. isbn:3540003886 https://doi.org/10.1007/3-540-36387-4 Google ScholarGoogle ScholarCross RefCross Ref
  21. Martin Grohe, Christof Löding, and Martin Ritzert. 2017. Learning MSO-definable hypotheses on strings. In Proceedings of the 28th International Conference on Algorithmic Learning Theory, Steve Hanneke and Lev Reyzin (Eds.) (Proceedings of Machine Learning Research, Vol. 76). PMLR, Kyoto University, Kyoto, Japan. 434–451. http://proceedings.mlr.press/v76/grohe17a.htmlGoogle ScholarGoogle Scholar
  22. Martin Grohe and Gy. Turán. 2004. Learnability and Definability in Trees and Similar Structures. Theory of Computing Systems, 37, 1 (2004), 01 Jan, 193–220. issn:1433-0490 https://doi.org/10.1007/s00224-003-1112-8 Google ScholarGoogle ScholarCross RefCross Ref
  23. Sumit Gulwani. 2011. Automating String Processing in Spreadsheets Using Input-Output Examples. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11). Association for Computing Machinery, New York, NY, USA. 317–330. isbn:9781450304900 https://doi.org/10.1145/1926385.1926423 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Qinheping Hu, Jason Breck, John Cyphert, Loris D’Antoni, and Thomas Reps. 2019. Proving Unrealizability for Syntax-Guided Synthesis. In Computer Aided Verification, Isil Dillig and Serdar Tasiran (Eds.) (Lecture Notes in Computer Science). Springer International Publishing, Cham. 335–352. isbn:978-3-030-25540-4 https://doi.org/10.1007/978-3-030-25540-4_18 Google ScholarGoogle ScholarCross RefCross Ref
  25. Qinheping Hu, John Cyphert, Loris D’Antoni, and Thomas Reps. 2020. Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2020). Association for Computing Machinery, New York, NY, USA. 1128–1142. isbn:9781450376136 https://doi.org/10.1145/3385412.3385979 Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Neil Immerman. 1982. Relational Queries Computable in Polynomial Time (Extended Abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC ’82). Association for Computing Machinery, New York, NY, USA. 147–152. isbn:0897910702 https://doi.org/10.1145/800070.802187 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini, and Frank Wolter. 2020. Logical Separability of Incomplete Data under Ontologies. CoRR, abs/2007.01610 (2020), arxiv:2007.01610Google ScholarGoogle Scholar
  28. Ayrat Khalimov, Benedikt Maderbacher, and Roderick Bloem. 2018. Bounded Synthesis of Register Transducers. In Automated Technology for Verification and Analysis, Shuvendu K. Lahiri and Chao Wang (Eds.). Springer International Publishing, Cham. 494–510. isbn:978-3-030-01090-4 https://doi.org/10.1007/978-3-030-01090-4_29 Google ScholarGoogle ScholarCross RefCross Ref
  29. Jason R. Koenig, Oded Padon, Neil Immerman, and Alex Aiken. 2020. First-Order Quantified Separators. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2020). Association for Computing Machinery, New York, NY, USA. 703–717. isbn:9781450376136 https://doi.org/10.1145/3385412.3386018 Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Paul Krogmeier and P. Madhusudan. 2021. Learning Formulas in Finite Variable Logics. arxiv:2111.03534.Google ScholarGoogle Scholar
  31. Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan, and Mahesh Viswanathan. 2020. Decidable Synthesis of Programs with Uninterpreted Functions. In Computer Aided Verification, Shuvendu K. Lahiri and Chao Wang (Eds.). Springer International Publishing, Cham. 634–657. isbn:978-3-030-53291-8 https://doi.org/10.1007/978-3-030-53291-8_32 Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, and Moshe Y. Vardi. 2000. Open Systems in Reactive Environments: Control and Synthesis. In CONCUR (Lecture Notes in Computer Science, Vol. 1877). Springer, 92–107. https://doi.org/10.1007/3-540-44618-4_9 Google ScholarGoogle ScholarCross RefCross Ref
  33. Orna Kupferman, Nir Piterman, and Moshe Y. Vardi. 2010. An Automata-Theoretic Approach to Infinite-State Systems. Springer Berlin Heidelberg, Berlin, Heidelberg. 202–259. isbn:978-3-642-13754-9 https://doi.org/10.1007/978-3-642-13754-9_11 Google ScholarGoogle Scholar
  34. Mark Law, Alessandra Russo, and Krysia Broda. 2014. Inductive Learning of Answer Set Programs. In Logics in Artificial Intelligence, Eduardo Fermé and João Leite (Eds.). Springer International Publishing, Cham. 311–325. isbn:978-3-319-11558-0 https://doi.org/10.1007/978-3-319-11558-0_22 Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Leonid Libkin. 2004. Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series). SpringerVerlag. isbn:3540212027 https://doi.org/10.1007/978-3-662-07003-1 Google ScholarGoogle ScholarCross RefCross Ref
  36. P. Madhusudan. 2011. Synthesizing Reactive Programs. In Computer Science Logic (CSL’11) - 25th International Workshop/20th Annual Conference of the EACSL, Marc Bezem (Ed.) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 12). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. 428–442. isbn:978-3-939897-32-3 issn:1868-8969 https://doi.org/10.4230/LIPIcs.CSL.2011.428 Google ScholarGoogle Scholar
  37. P. Madhusudan and P. S. Thiagarajan. 2001. Distributed Controller Synthesis for Local Specifications. In ICALP (Lecture Notes in Computer Science, Vol. 2076). Springer, 396–407. https://doi.org/10.1007/3-540-48224-5_33 Google ScholarGoogle ScholarCross RefCross Ref
  38. Zohar Manna and Richard Waldinger. 1980. A Deductive Approach to Program Synthesis. ACM Trans. Program. Lang. Syst., 2, 1 (1980), Jan., 90–121. issn:0164-0925 https://doi.org/10.1145/357084.357090 Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Umang Mathur, P. Madhusudan, and Mahesh Viswanathan. 2019. Decidable Verification of Uninterpreted Programs. Proc. ACM Program. Lang., 3, POPL (2019), Article 46, Jan., 29 pages. issn:2475-1421 https://doi.org/10.1145/3290359 Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Tom M. Mitchell. 1982. Generalization as search. Artificial Intelligence, 18, 2 (1982), 203–226. issn:0004-3702 https://doi.org/10.1016/0004-3702(82)90040-6 Google ScholarGoogle ScholarCross RefCross Ref
  41. Thomas M. Mitchell. 1997. Machine Learning (1 ed.). McGraw-Hill, Inc., USA. isbn:0070428077Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Stephen Muggleton and Luc de Raedt. 1994. Inductive Logic Programming: Theory and methods. The Journal of Logic Programming, 19-20 (1994), 629–679. issn:0743-1066 https://doi.org/10.1016/0743-1066(94)90035-3 Google ScholarGoogle ScholarCross RefCross Ref
  43. Stephen H. Muggleton, Dianhuan Lin, Niels Pahlavi, and Alireza Tamaddoni-Nezhad. 2014. Meta-interpretive learning: application to grammatical inference. Machine Learning, 94, 1 (2014), 01 Jan, 25–49. issn:1573-0565 https://doi.org/10.1007/s10994-013-5358-3 Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Daniel Neider and Ivan Gavran. 2018. Learning Linear Temporal Properties. In 2018 Formal Methods in Computer Aided Design (FMCAD). 1–10. https://doi.org/10.23919/FMCAD.2018.8603016 Google ScholarGoogle ScholarCross RefCross Ref
  45. Peter-Michael Osera and Steve Zdancewic. 2015. Type-and-Example-Directed Program Synthesis. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’15). Association for Computing Machinery, New York, NY, USA. 619–630. isbn:9781450334686 https://doi.org/10.1145/2737924.2738007 Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Amir Pnueli and Roni Rosner. 1989. On the Synthesis of a Reactive Module. In POPL. ACM Press, 179–190. https://doi.org/10.1145/75277.75293 Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Amir Pnueli and Roni Rosner. 1990. Distributed Reactive Systems Are Hard to Synthesize. In FOCS. IEEE Computer Society, 746–757. https://doi.org/10.1109/FSCS.1990.89597 Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Nadia Polikarpova, Ivan Kuraj, and Armando Solar-Lezama. 2016. Program Synthesis from Polymorphic Refinement Types. In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’16). Association for Computing Machinery, New York, NY, USA. 522–538. isbn:9781450342612 https://doi.org/10.1145/2908080.2908093 Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Oleksandr Polozov and Sumit Gulwani. 2015. FlashMeta: A Framework for Inductive Program Synthesis. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2015). Association for Computing Machinery, New York, NY, USA. 107–126. isbn:9781450336895 https://doi.org/10.1145/2814270.2814310 Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Michael Oser Rabin. 1972. Automata on Infinite Objects and Church’s Problem. American Mathematical Society, Boston, MA, USA. isbn:0821816632 https://dl.acm.org/doi/10.5555/540412Google ScholarGoogle Scholar
  51. Yanyan Shen, Kaushik Chakrabarti, Surajit Chaudhuri, Bolin Ding, and Lev Novik. 2014. Discovering Queries Based on Example Tuples. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD ’14). Association for Computing Machinery, New York, NY, USA. 493–504. isbn:9781450323765 https://doi.org/10.1145/2588555.2593664 Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Armando Solar-Lezama, Liviu Tancau, Rastislav Bodik, Sanjit Seshia, and Vijay Saraswat. 2006. Combinatorial Sketching for Finite Programs. In Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XII). Association for Computing Machinery, New York, NY, USA. 404–415. isbn:1595934510 https://doi.org/10.1145/1168857.1168907 Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Aalok Thakkar, Aaditya Naik, Nathaniel Sands, Rajeev Alur, Mayur Naik, and Mukund Raghothaman. 2021. Example-Guided Synthesis of Relational Queries. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI 2021). Association for Computing Machinery, New York, NY, USA. 1110–1125. isbn:9781450383912 https://doi.org/10.1145/3453483.3454098 Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Steffen van Bergerem. 2019. Learning Concepts Definable in First-Order Logic with Counting. In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 1–13. https://doi.org/10.1109/LICS.2019.8785811 Google ScholarGoogle Scholar
  55. Steffen van Bergerem, Martin Grohe, and Martin Ritzert. 2021. On the Parameterized Complexity of Learning Logic. CoRR, abs/2102.12201 (2021), arxiv:2102.12201.Google ScholarGoogle Scholar
  56. Moshe Y. Vardi. 1982. The Complexity of Relational Query Languages (Extended Abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC ’82). Association for Computing Machinery, New York, NY, USA. 137–146. isbn:0897910702 https://doi.org/10.1145/800070.802186 Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Moshe Y. Vardi. 1998. Reasoning about the past with two-way automata. In Automata, Languages and Programming, Kim G. Larsen, Sven Skyum, and Glynn Winskel (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 628–641. isbn:978-3-540-68681-1 https://doi.org/10.1007/BFb0055090 Google ScholarGoogle ScholarCross RefCross Ref
  58. Victor Vianu. 2020. Personal communication.Google ScholarGoogle Scholar
  59. Chenglong Wang, Alvin Cheung, and Rastislav Bodik. 2017. Synthesizing Highly Expressive SQL Queries from Input-Output Examples. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2017). Association for Computing Machinery, New York, NY, USA. 452–466. isbn:9781450349888 https://doi.org/10.1145/3062341.3062365 Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. Xinyu Wang, Isil Dillig, and Rishabh Singh. 2017. Program Synthesis Using Abstraction Refinement. Proc. ACM Program. Lang., 2, POPL (2017), Article 63, Dec., 30 pages. issn:2475-1421 https://doi.org/10.1145/3158151 Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Xinyu Wang, Isil Dillig, and Rishabh Singh. 2017. Synthesis of Data Completion Scripts Using Finite Tree Automata. Proc. ACM Program. Lang., 1, OOPSLA (2017), Article 62, Oct., 26 pages. https://doi.org/10.1145/3133886 Google ScholarGoogle ScholarDigital LibraryDigital Library
  62. Yuepeng Wang, Xinyu Wang, and Isil Dillig. 2018. Relational Program Synthesis. Proc. ACM Program. Lang., 2, OOPSLA (2018), Article 155, Oct., 27 pages. issn:2475-1421 https://doi.org/10.1145/3276525 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Learning formulas in finite variable logics

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!