Campus Units

Aerospace Engineering, Computer Science, Electrical and Computer Engineering, Mathematics, Virtual Reality Applications Center

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

8-18-2020

Journal or Book Title

Artificial Intelligence

First Page

103369

DOI

10.1016/j.artint.2020.103369

Abstract

Linear Temporal Logic over finite traces (LTLf ) was proposed in 2013 and has attracted increasing interest around the AI community. Though the theoretic basis for LTLf has been thoroughly explored since that time, there are still few algorithmic tools that are able to provide an efficient reasoning strategy for LTLf . In this paper, we present a SAT-based framework for LTLf satisfiability checking, which is the foundation of LTLf reasoning. We use propositional SAT-solving techniques to construct a transition system, which is an automata-style structure, for an input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Based on this framework, we further present CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm (heuristic) that leverages information produced by propositional SAT solvers, utilizing both satisfiability and unsatisfiability results. More specifically, the satisfiable results of the SAT solver are used to create new states of the transition system and the unsatisfiable results to accelerate the path search over the system. We evaluate all 5 off-the-shelf LTLf satisfiability algorithms against our new approach CDLSC. Based on a comprehensive evaluation over 4 different LTLf benchmark suits with a total amount of 9317 formulas, our time-cost analysis shows that 1) CDLSC performs best on checking unsatisfiable formulas by achieving approximately a 4X time speedup, compared to the second-best solution (K-LIVE [1]); 2) Although no approaches dominate checking satisfiable formulas, CDLSC performs best on 2 of the total 4 tested satisfiable benchmark suits; and 3) CDLSC gains the best overall performance when considering both satisfiable and unsatisfiable instances.

Comments

This is a manuscript of an article published as Li, Jianwen, Geguang Pu, Yueling Zhang, Moshe Y. Vardi, and Kristin Y. Rozier. "SAT-based Explicit LTLf Satisfiability Checking." Artificial Intelligence (2020): 103369. DOI: 10.1016/j.artint.2020.103369. Posted with permission.

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Copyright Owner

Elsevier B.V.

Language

en

File Format

application/pdf

Available for download on Thursday, August 18, 2022

Published Version

Share

COinS