Learning Interpretable Models in the Property Specification Language

02/10/2020
by   Rajarshi Roy, et al.
17

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. Our learning algorithm 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 9

04/30/2021

Learning Linear Temporal Properties from Noisy Data: A MaxSAT Approach

We address the problem of inferring descriptions of system behavior usin...
06/11/2018

Learning Linear Temporal Properties

We present two novel algorithms for learning formulas in Linear Temporal...
10/17/2011

Reasoning about Actions with Temporal Answer Sets

In this paper we combine Answer Set Programming (ASP) with Dynamic Linea...
10/13/2021

Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic

Linear temporal logic (LTL) is a specification language for finite seque...
09/24/2019

Learning definable hypotheses on trees

We study the problem of learning properties of nodes in tree structures....
02/25/2020

Weighted PCL over product valuation monoids

We introduce a weighted propositional configuration logic over a product...
09/27/2020

Learning event-driven switched linear systems

We propose an automata theoretic learning algorithm for the identificati...

Code Repositories

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.