TY - JOUR
T1 - MaxSAT-based temporal logic inference from noisy data
AU - Gaglione, Jean Raphaël
AU - Neider, Daniel
AU - Roy, Rajarshi
AU - Topcu, Ufuk
AU - Xu, Zhe
N1 - Funding Information:
This work has been supported by the Defense Advanced Research Projects Agency (DARPA) (Contract number HR001120C0032), Army Research Laboratory (ARL) (Contract number W911NF2020132 and ACC-APG-RTP W911NF), National Science Foundation (NSF) (Contract Number 1646522), and Deutsche Forschungsgemeinschaft (DFG) (Grant Number 434592664).
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.
PY - 2022/9
Y1 - 2022/9
N2 - We address the problem of inferring descriptions of system behavior using temporal logic from a finite set of positive and negative examples. In this paper, we consider two formalisms of temporal logic that describe linear time properties: Linear Temporal Logic over finite horizon (LTLf) and Signal Temporal Logic (STL). For inferring formulas in either of the formalism, most of the existing approaches rely on predefined templates that guide the structure of the inferred formula. On the other hand, the approaches that can infer arbitrary formulas are not robust to noise in the data. To alleviate such limitations, we devise two algorithms for inferring concise formulas even in the presence of noise. Our first approach to infer minimal formulas involves reducing the inference problem to a problem in maximum satisfiability and then using off-the-shelf solvers to find a solution. To the best of our knowledge, we are the first to incorporate the usage of MaxSAT/MaxSMT solvers for inferring formulas in LTLf and STL. Our second approach relies on the first approach to derive a decision tree over temporal formulas exploiting standard decision tree learning algorithm. We have implemented our approaches and verified their efficacy in learning concise descriptions in the presence of noise.
AB - We address the problem of inferring descriptions of system behavior using temporal logic from a finite set of positive and negative examples. In this paper, we consider two formalisms of temporal logic that describe linear time properties: Linear Temporal Logic over finite horizon (LTLf) and Signal Temporal Logic (STL). For inferring formulas in either of the formalism, most of the existing approaches rely on predefined templates that guide the structure of the inferred formula. On the other hand, the approaches that can infer arbitrary formulas are not robust to noise in the data. To alleviate such limitations, we devise two algorithms for inferring concise formulas even in the presence of noise. Our first approach to infer minimal formulas involves reducing the inference problem to a problem in maximum satisfiability and then using off-the-shelf solvers to find a solution. To the best of our knowledge, we are the first to incorporate the usage of MaxSAT/MaxSMT solvers for inferring formulas in LTLf and STL. Our second approach relies on the first approach to derive a decision tree over temporal formulas exploiting standard decision tree learning algorithm. We have implemented our approaches and verified their efficacy in learning concise descriptions in the presence of noise.
KW - Decision tree
KW - Explainable AI
KW - Linear Temporal Logic
KW - Signal Temporal Logic
KW - Specification mining
UR - http://www.scopus.com/inward/record.url?scp=85127680622&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85127680622&partnerID=8YFLogxK
U2 - 10.1007/s11334-022-00444-8
DO - 10.1007/s11334-022-00444-8
M3 - Article
AN - SCOPUS:85127680622
SN - 1614-5046
VL - 18
SP - 427
EP - 442
JO - Innovations in Systems and Software Engineering
JF - Innovations in Systems and Software Engineering
IS - 3
ER -