A clausal resolution method for extended computation tree logic ECTL
From MaRDI portal
Publication:2495388
DOI10.1016/J.JAL.2005.06.003zbMath1101.03017OpenAlexW2180066852MaRDI QIDQ2495388
Artie Basukoski, Alexander Bolotov
Publication date: 30 June 2006
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2005.06.003
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)
Related Items (3)
A clausal resolution method for branching-time logic \(\text{ECTL}^+\) ⋮ Alternating automata and temporal logic normal forms ⋮ A clausal resolution method for extended computation tree logic ECTL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A clausal resolution method for extended computation tree logic ECTL
- On the Relationship between -automata and Temporal Logic Normal Forms
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- A clausal resolution method for CTL branching-time temporal logic
This page was built for publication: A clausal resolution method for extended computation tree logic ECTL
