CTL-RP: A computation tree logic resolution prover (Q3568224)

From MaRDI portal
Revision as of 08:40, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
CTL-RP: A computation tree logic resolution prover
scientific article

    Statements

    title
    CTL-RP: A computation tree logic resolution prover (English)
    0 references
    author
    Lan Zhang
    0 references
    Ullrich Hustadt
    0 references
    Clare Dixon
    0 references
    publication date
    17 June 2010
    0 references
    zbMATH Keywords
    branching-time temporal logics, resolution theorem proving
    0 references
    describes a project that uses
    TRP++
    0 references
    SPASS
    0 references

    Identifiers

    DOI
    10.3233/AIC-2010-0463
    0 references
    zbMATH DE Number
    5722874
    0 references
    OpenAlex ID
    W1671579239
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3568224&oldid=36926325"
    Powered by MediaWiki