A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2751353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clausal resolution method for CTL branching-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clausal resolution method for extended computation tree logic ECTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank

Latest revision as of 12:58, 25 June 2024

scientific article
Language Label Description Also known as
English
A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
scientific article

    Statements

    A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (English)
    0 references
    0 references
    0 references
    24 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automated deduction
    0 references
    branching-time logic
    0 references
    program specification and verification
    0 references
    resolution
    0 references
    0 references