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.
Supplemental Material
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- Paul Krogmeier and P. Madhusudan. 2021. Learning Formulas in Finite Variable Logics. arxiv:2111.03534.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- Thomas M. Mitchell. 1997. Machine Learning (1 ed.). McGraw-Hill, Inc., USA. isbn:0070428077Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- Victor Vianu. 2020. Personal communication.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Index Terms
Learning formulas in finite variable logics
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Languages with Decidable Learning: A Meta-theorem
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidable learning. The semantics of such languages can be defined using a ...
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propositional dynamic logic (PDL) to MSO over trees, Kracht (1997) noted that ...






Comments