arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.15083cs.LGcs.AIcs.FL
收藏

从噪声数据中学习线性时间特性:一种MaxSAT方法

Learning Linear Temporal Properties from Noisy Data: A MaxSAT Approach

Ecole Polytechnique(巴黎综合理工学院);Max Planck Institute for Software Systems(马克斯·普朗克软件系统研究所);University of Texas at Austin(德克萨斯大学奥斯汀分校);Arizona State University(亚利桑那州立大学)

Jean-Raphaël Gaglione, Daniel Neider, Rajarshi Roy, Ufuk Topcu, Zhe Xu

摘要:

我们解决的问题,使用线性时序逻辑(LTL)从一组有限的正面和负面的例子推断系统行为的描述。大多数现有的方法来解决这样的任务依赖于预定义的模板来指导推断公式的结构。另一方面,可以推断任意LTL公式的方法对数据中的噪声不鲁棒。为了减轻这些限制,我们设计了两个算法,即使在存在噪声的情况下,也可以推断出简洁的LTL公式。我们的第一个算法推断最小的LTL公式减少推理问题的最大可满足性的问题,然后使用现成的MaxSAT求解器找到一个解决方案。据我们所知,我们是第一个将MaxSAT求解器用于LTL公式推断的公司。我们的第二个学习算法依赖于第一个算法来推导基于决策树学习算法的LTL公式上的决策树。我们已经实现了我们的算法,并验证了我们的算法是有效的,即使在存在噪声的情况下提取简洁的LTL描述。

英文摘要:

We address the problem of inferring descriptions of system behavior using Linear Temporal Logic (LTL) from a finite set of positive and negative examples. Most of the existing approaches for solving such a task rely on predefined templates for guiding the structure of the inferred formula. The approaches that can infer arbitrary LTL formulas, on the other hand, are not robust to noise in the data. To alleviate such limitations, we devise two algorithms for inferring concise LTL formulas even in the presence of noise. Our first algorithm infers minimal LTL formulas by reducing the inference problem to a problem in maximum satisfiability and then using off-the-shelf MaxSAT solvers to find a solution. To the best of our knowledge, we are the first to incorporate the usage of MaxSAT solvers for inferring formulas in LTL. Our second learning algorithm relies on the first algorithm to derive a decision tree over LTL formulas based on a decision tree learning algorithm. We have implemented both our algorithms and verified that our algorithms are efficient in extracting concise LTL descriptions even in the presence of noise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑