A tableau for RoBCTL

John Mccabe-Dansted

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    6 Citations (Scopus)


    It can be desirable to specify polices that require a system to achieve some outcome even if a certain number of failures occur. The temporal logic of robustness RoCTL* extends CTL* with operators from Deontic logic, and a novel operator referred to as “Robustly” [7]. The only known decision procedure for RoCTL* involves a reduction to QCTL*. This paper presents a tableau for the related bundled tree logic RoBCTL*; this is the first decision procedure for RoBCTL*, and although non-elementary in degenerate cases has much better performance than the QCTL* based decision procedure for RoCTL*. The degenerate cases where this tableau performs poorly provide clues as to where we might look to prove that RoBCTL* is non-elementary.
    Original languageEnglish
    Title of host publicationLogics in Artificial Intelligence
    Subtitle of host publication11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings
    Place of PublicationUSA
    Pages298 - 310
    ISBN (Electronic)978-3-540-87803-2
    ISBN (Print)978-3-540-87802-5
    Publication statusPublished - 2008
    Event11th European Conference on Logics in Artificial Intelligence - Dresden, Germany
    Duration: 28 Sep 20081 Oct 2008

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Electronic)0302-9743


    Conference11th European Conference on Logics in Artificial Intelligence
    Abbreviated titleJELIA 2008


    Dive into the research topics of 'A tableau for RoBCTL'. Together they form a unique fingerprint.

    Cite this