We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. The crux of our approach is a construction of temporal transition system that is based on SAT-solving rather than tableau to construct states and transitions. As a proof-of-concept of this framework, we describe a new LTL satisfiability algorithm. We tested the effectiveness of this approach by demonstrating that it significantly outperforms all existing LTL-satisfiability-checking algorithms.

中文翻译：

---

基于 SAT 的显式 LTL 推理及其在可满足性检查中的应用

我们在这里提出了一个新的线性时序逻辑 (LTL) 显式推理框架，它建立在命题可满足性 (SAT) 求解之上。我们方法的关键是构建基于 SAT 求解而不是表格来构建状态和转换的时间转换系统。作为该框架的概念证明，我们描述了一种新的 LTL 可满足性算法。我们通过证明它显着优于所有现有的 LTL 可满足性检查算法来测试这种方法的有效性。