Artale, A. and Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2013) The complexity of clausal fragments of LTL. In: McMillan, K. and Middeldorp, A. and Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 8312. Berlin, Germany: Springer, pp. 35-52. ISBN 9783642452215.
|
Text
lpar13-final.pdf - Author's Accepted Manuscript Download (495kB) | Preview |
Abstract
We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (ℤ, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computational complexity of the satisfiability problem for each of the fragments, which ranges from NLogSpace to PTime, NP and PSpace.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings “The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-45221-5_3" |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 11 Aug 2014 10:10 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10334 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
