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
676 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献