Affiliation:
1. Manchester Metropolitan Univ., Manchester, UK
2. Victoria Univ. of Manchester, Manchester, UK
Abstract
In this article, we examine how clausal resolution can be applied to a specific, but widely used, nonclassical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples, and examine the correctness and complexity of this approach. Finally, we describe related work and future developments concerning this work.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning to Check LTL Satisfiability and to Generate Traces via Differentiable Trace Checking;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
2. SAT-Verifiable LTL Satisfiability Checking via Graph Representation Learning;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11
3. Computing minimal unsatisfiable core for LTL over finite traces;Journal of Logic and Computation;2023-08-04
4. Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic;Studia Logica;2023-06-14
5. Checking LTL Satisfiability via End-to-end Learning;Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering;2022-10-10