BIROn - Birkbeck Institutional Research Online

    The complexity of clausal fragments of LTL

    Artale, A. and Kontchakov, Roman and Ryzhikov, V. 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.

    [img]
    Preview
    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 Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 11 Aug 2014 10:10
    Last Modified: 27 Jul 2019 17:36
    URI: http://eprints.bbk.ac.uk/id/eprint/10334

    Statistics

    Downloads
    Activity Overview
    138Downloads
    130Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item