Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic

10/13/2021
by   Ritam Raha, et al.
0

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL formulas for classifying traces; despite a growing interest of the research community, existing solutions suffer from two limitations: they do not scale beyond small formulas, and they may exhaust computational resources without returning any result. We introduce a new algorithm addressing both issues: our algorithm is able to construct formulas an order of magnitude larger than previous methods, and it is anytime, meaning that it in most cases successfully outputs a formula, albeit possibly not of minimal size. We evaluate the performances of our algorithm using an open source implementation against publicly available benchmarks.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/26/2021

Automata Linear Dynamic Logic on Finite Traces

Temporal logics are widely used by the Formal Methods and AI communities...
02/01/2022

First-order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications

Formalisms based on temporal logics interpreted over finite strict linea...
02/10/2020

Learning Interpretable Models in the Property Specification Language

We address the problem of learning human-interpretable descriptions of a...
04/09/2019

The Complexity of Definability by Open First-Order Formulas

In this article we formally define and investigate the computational com...
04/28/2022

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where...
06/11/2018

Learning Linear Temporal Properties

We present two novel algorithms for learning formulas in Linear Temporal...
07/11/2019

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, i...
This week in AI

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