Campus Units

Aerospace Engineering, Computer Science, Electrical and Computer Engineering

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

11-7-2018

Journal or Book Title

arXiv

Abstract

We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existing approaches for LTLf satisfiability checking, by demonstrating an approximate four-fold speedup compared to the second-best solver.

Comments

This is a pre-print of the article Li, Jianwen, Kristin Y. Rozier, Geguang Pu, Yueling Zhang, and Moshe Y. Vardi. "SAT-based Explicit LTLf Satisfiability Checking." arXiv preprint arXiv:1811.03176 (2018). Posted with permission.

Copyright Owner

Association for the Advancement of Artificial Intelligence

Language

en

File Format

application/pdf

Published Version

Share

COinS