{"type":"ScholarlyArticle","title":"Learning Interpretable Models in the Property Specification Language","authors":[{"name":"Rajarshi Roy","slug":"rajarshi-roy","given":"Rajarshi","family":"Roy","affiliation":"Max Planck Institute for Software Systems , Kaiserslautern , Germany"},{"name":"Dana Fisman","slug":"dana-fisman","given":"Dana","family":"Fisman","affiliation":"Ben-Gurion University , Be'er Sheva , Israel"},{"name":"Daniel Neider","slug":"daniel-neider","given":"Daniel","family":"Neider","affiliation":"Max Planck Institute for Software Systems , Kaiserslautern , Germany"}],"abstract":"We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of the recent work in this area, which focuses on descriptions expressed in Linear Temporal Logic (LTL), we develop a learning algorithm for formulas in the IEEE standard temporal logic PSL (Property Specification Language). Our work is motivated by the fact that many natural properties, such as an event happening at every n-th point in time, cannot be expressed in LTL, whereas it is easy to express such properties in PSL. Moreover, formulas in PSL can be more succinct and easier to interpret (due to the use of regular expressions in PSL formulas) than formulas in LTL. The learning algorithm we designed, builds on top of an existing algorithm for learning LTL formulas. Roughly speaking, our algorithm reduces the learning task to a constraint satisfaction problem in propositional logic and then uses a SAT solver to search for a solution in an incremental fashion. We have implemented our algorithm and performed a comparative study between the proposed method and the existing LTL learning algorithm. Our results illustrate the effectiveness of the proposed approach to provide succinct human-interpretable descriptions from examples.","doi":"10.24963/ijcai.2020/306","url":"https://ijcai.org/proceedings/2020/306","pdf":"https://ijcai.org/proceedings/2020/0306.pdf","markdown":"https://ijcai.org/proceedings/2020/306.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/306","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Machine Learning","track":"Main track","number":306,"pages":{"first":2213,"last":2219},"keywords":["Machine Learning: Explainable Machine Learning","Machine Learning: Classification","Constraints and SAT: SAT: : Solvers and Applications"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25031/file_25031.m3u8","length_sec":299,"provider":"hls"}],"references":[{"position":1,"raw":"[Alur et al., 2015] Rajeev Alur, Rastislav Bodík, Eric Dal- lal, 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. Syntax-guided synthesis. In Dependable Software Systems Engineering, pages 1-25. 2015.","title":"Syntax-guided synthesis","authors":"Rajeev Alur, Rastislav Bodík, Eric Dallal, Dana Fisman, Pranav Garg, Garvit Juniwal, Hadas Kress-Gazit, P Madhusudan, M K Milo, Mukund Martin, Shambwaditya Raghothaman, Sanjit A Saha, Rishabh Seshia, Armando Singh, Emina Solar-Lezama, Abhishek Torlak, Udupa","year":"2015","venue":"Dependable Software Systems Engineering","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur et al., 2018] Rajeev Alur, Rishabh Singh, Dana Fisman, and Armando Solar-Lezama. Search-based program syn- thesis. Commun. ACM, 61(12):84-93, 2018.","title":"Search-based program synthesis","authors":"Rajeev Alur, Rishabh Singh, Dana Fisman, Armando Solar-Lezama","year":"2018","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Armoni et al., 2002] Roy Armoni, Limor Fix, Alon Flaisher, Rob Gerth, Boris Ginsburg, Tomer Kanza, Avner Land- ver, Sela Mador-Haim, Eli Singerman, Andreas Tiemeyer, Moshe Y. Vardi, and Yael Zbar. The forspec temporal logic: A new temporal property-specification language. In 8th International Conference of Tools and Algorithms for the Construction and Analysis of Systems, TACAS '02, volume 2280 of LNCS, pages 296-211. Springer, 2002.","title":"The forspec temporal logic: A new temporal property-specification language","authors":"Roy Armoni, Limor Fix, Alon Flaisher, Rob Gerth, Boris Ginsburg, Tomer Kanza, Avner Landver, Sela Mador-Haim, Eli Singerman, Andreas Tiemeyer, Moshe Y Vardi, Yael Zbar","year":"2002","venue":"8th International Conference of Tools and Algorithms for the Construction and Analysis of Systems, TACAS '02","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Balyo et al., 2017] Tomás Balyo, Marijn J. H. Heule, and Matti Järvisalo. SAT competition 2016: Recent develop- ments. In 31st AAAI Conference on Artificial Intelligence, AAAI '17, pages 5061-5063. AAAI Press, 2017.","title":"SAT competition 2016: Recent developments","authors":"Tomás Balyo, J H Marijn, Matti Heule, Järvisalo","year":"2017","venue":"31st AAAI Conference on Artificial Intelligence, AAAI '17","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bartoli et al., 2014] Alberto Bartoli, Giorgio Davanzo, An- drea De Lorenzo, Eric Medvet, and Enrico Sorio. Au- tomatic synthesis of regular expressions from examples. IEEE Computer, 47(12):72-80, 2014.","title":"Automatic synthesis of regular expressions from examples","authors":"Alberto Bartoli, Giorgio Davanzo, Andrea De Lorenzo, Eric Medvet, Enrico Sorio","year":"2014","venue":"IEEE Computer","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Camacho and McIlraith, 2019] Alberto Camacho and Sheila A. McIlraith. Learning interpretable models expressed in linear temporal logic. In 29th International Conference on Automated Planning and Scheduling, ICAPS '18, pages 621-630. AAAI Press, 2019.","title":"Learning interpretable models expressed in linear temporal logic","authors":"Alberto Camacho, Sheila A Mcilraith","year":"2019","venue":"29th International Conference on Automated Planning and Scheduling, ICAPS '18","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chesani et al., 2009] Federico Chesani, Evelina Lamma, Paola Mello, Marco Montali, Fabrizio Riguzzi, and Ser- gio Storari. Exploiting inductive logic programming tech- niques for declarative process mining. Trans. Petri Nets Other Model. Concurr., 2:278-295, 2009.","title":"Exploiting inductive logic programming techniques for declarative process mining","authors":"Federico Chesani, Evelina Lamma, Paola Mello, Marco Montali, Fabrizio Riguzzi, Sergio Storari","year":"2009","venue":"Trans. Petri Nets Other Model. Concurr","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cook, 1971] Stephen A. Cook. The complexity of theorem- proving procedures. In 3rd Annual ACM Symposium on Theory of Computing, STOC '71, pages 151-158. ACM, 1971.","title":"The complexity of theoremproving procedures","authors":"Stephen A Cook","year":"1971","venue":"3rd Annual ACM Symposium on Theory of Computing, STOC '71","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[de Moura and Bjørner, 2008] Leonardo Mendonc ¸a de Moura and Nikolaj Bjørner. Z3: an efficient SMT solver. In 14th International Conference of Tools and Algorithms for the Construction and Analysis of Systems, TACAS '08, volume 4963 of LNCS, pages 337-340.","title":"Leonardo Mendonc ¸a de Moura and Nikolaj Bjørner. Z3: an efficient SMT solver","authors":"De Moura, Bjørner","year":"2008","venue":"14th International Conference of Tools and Algorithms for the Construction and Analysis of Systems, TACAS '08","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eisner and Fisman, 2006] Cindy Eisner and Dana Fisman. A Practical Introduction to PSL. Series on Integrated Circuits and Systems. Springer, 2006.","title":"Series on Integrated Circuits and Systems","authors":"Fisman Eisner, Cindy Eisner, Dana Fisman","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Eisner and Fisman, 2018] Cindy Eisner and Dana Fisman. Functional specification of hardware via temporal logic. In Handbook of Model Checking, pages 795-829. 2018.","title":"Functional specification of hardware via temporal logic","authors":"Fisman ; Eisner, Cindy Eisner, Dana Fisman","year":"2018","venue":"Handbook of Model Checking","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Heule and Verwer, 2010] Marijn Heule and Sicco Verwer. Exact DFA identification using SAT solvers. In 10th Inter- national Colloquium of Grammatical Inference: Theoret- ical Results and Applications, ICGI '10, volume 6339 of LNCS, pages 66-79. Springer, 2010.","title":"Exact DFA identification using SAT solvers","authors":"Verwer Heule, Marijn Heule, Sicco Verwer","year":"2010","venue":"10th International Colloquium of Grammatical Inference: Theoretical Results and Applications","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[IEEE Standards Association, 2010] IEEE Standards Associ- ation. IEEE 1850-2010 -IEEE standard for property speci- fication language (PSL), 2010.","title":"IEEE Standards Association. IEEE 1850-2010","authors":null,"year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kim et al., 2019] Joseph Kim, Christian Muise, Ankit Shah, Shubham Agarwal, and Julie Shah. Bayesian inference of linear temporal logic specifications for contrastive explana- tions. In 28th International Joint Conference on Artificial Intelligence, IJCAI '19, pages 5591-5598. ijcai.org, 2019.","title":"Bayesian inference of linear temporal logic specifications for contrastive explanations","authors":"Joseph Kim, Christian Muise, Ankit Shah, Shubham Agarwal, Julie Shah","year":"2019","venue":"28th International Joint Conference on Artificial Intelligence, IJCAI '19","doi":null,"url":null,"internal_url":"/proceedings/2019/776"},{"position":15,"raw":"[Kong et al., 2017] Zhaodan Kong, Austin Jones, and Calin Belta. Temporal logics for learning and detection of anoma- lous behavior. IEEE Trans. Automat. Contr., 62(3):1210- 1222, 2017.","title":"Temporal logics for learning and detection of anomalous behavior","authors":"Kong","year":"2017","venue":"IEEE Trans. Automat. Contr","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lamma et al., 2007] Evelina Lamma, Paola Mello, Marco Montali, Fabrizio Riguzzi, and Sergio Storari. Inducing declarative logic-based models from labeled traces. In BPM, volume 4714 of LNCS, pages 344-359. Springer, 2007.","title":"Inducing declarative logic-based models from labeled traces","authors":"Evelina Lamma, Paola Mello, Marco Montali, Fabrizio Riguzzi, Sergio Storari","year":"2007","venue":"BPM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lemieux et al., 2015] Caroline Lemieux, Dennis Park, and Ivan Beschastnikh. General LTL specification mining (T). In 30th IEEE/ACM International Conference on Automated Software Engineering, ASE '15, pages 81-92. IEEE Com- puter Society, 2015.","title":"General LTL specification mining (T)","authors":"Caroline Lemieux, Dennis Park, Ivan Beschastnikh","year":"2015","venue":"30th IEEE/ACM International Conference on Automated Software Engineering, ASE '15","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Li et al., 2011] Wenchao Li, Lili Dworkin, and Sanjit A. Se- shia. Mining assumptions for synthesis. In 9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, MEMOCODE '11, pages 43-50. IEEE, 2011.","title":"Mining assumptions for synthesis","authors":"Wenchao Li, Lili Dworkin, A Sanjit","year":"2011","venue":"9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, MEMOCODE '11","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Neider and Gavran, 2018] Daniel Neider and Ivan Gavran. Learning linear temporal properties. In 2018 Formal Meth- ods in Computer Aided Design, FMCAD '18, pages 1-10. IEEE, 2018.","title":"Learning linear temporal properties","authors":"Gavran Neider, Daniel Neider, Ivan Gavran","year":"2018","venue":"Formal Methods in Computer Aided Design","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Neider, 2012] Daniel Neider. Computing minimal separating dfas and regular invariants using SAT and SMT solvers. In 10th International Symposium of Automated Technology for Verification and Analysis, ATVA '12, volume 7561 of LNCS, pages 354-369. Springer, 2012.","title":"Computing minimal separating dfas and regular invariants using SAT and SMT solvers","authors":"Daniel Neider","year":"2012","venue":"10th International Symposium of Automated Technology for Verification and Analysis, ATVA '12","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Pnueli, 1977] Amir Pnueli. The temporal logic of programs. In 18th Annual Symposium of Foundations of Computer Science, FOCS '77, pages 46-57. IEEE Computer Society, 1977.","title":"The temporal logic of programs","authors":"Amir Pnueli, Pnueli","year":"1977","venue":"18th Annual Symposium of Foundations of Computer Science, FOCS '77","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Riener, 2019] Heinz Riener. Exact synthesis of LTL prop- erties from traces. In 2019 Forum for Specification and Design Languages, FDL '19, pages 1-6. IEEE, 2019.","title":"Exact synthesis of LTL properties from traces","authors":"Heinz Riener","year":"2019","venue":"Forum for Specification and Design Languages, FDL '19","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wasylkowski and Zeller, 2009] Andrzej Wasylkowski and Andreas Zeller. Mining temporal specifications from object usage. In 24th IEEE/ACM International Conference on Automated Software Engineering, ASE '09, pages 295-306. IEEE Computer Society, 2009.","title":"Mining temporal specifications from object usage","authors":"Zeller Wasylkowski, Andrzej Wasylkowski, Andreas Zeller","year":"2009","venue":"24th IEEE/ACM International Conference on Automated Software Engineering, ASE '09","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wolper, 1981] Pierre Wolper. Temporal logic can be more expressive. In 22nd Annual Symposium on Foundations of Computer Science, FOCS '81, pages 340-348. IEEE Computer Society, 1981.","title":"Temporal logic can be more expressive","authors":"Pierre Wolper, Wolper","year":"1981","venue":"22nd Annual Symposium on Foundations of Computer Science, FOCS '81","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}