Affiliation:
1. Univ. of Massachusetts, Amherst
2. Carnegie-Mellon Univ., Pittsburgh, PA
Abstract
The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional linear temporal logics. It is shown that these problems are NP-complete for the logic with F and are PSPACE-complete for the logics with F, X, with U, with U, S, X operators and for the extended logic with regular operators given by Wolper.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference10 articles.
1. The computational complexity of provabiiity in systems of modal propositional logic;LADNER R;SlAM J. Comput.,1977
2. the size of refutation Kripke models for some linear modal and tense logics;ONO H.;Studia Logica,1980
Cited by
664 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Perspective Games;ACM Transactions on Computational Logic;2024-01-17
2. On the Complexity of Model Checking Knowledge and Time;ACM Transactions on Computational Logic;2024-01-16
3. Using On-The-Fly Model Checking to improve Constraint Programming for Dynamic Problems;2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI);2023-11-06
4. Probabilistic temporal logic with countably additive semantics;Annals of Pure and Applied Logic;2023-11
5. Taming Strategy Logic: Non-Recurrent Fragments;Information and Computation;2023-10