CTL-RP: A computation tree logic resolution prover

DOI10.3233/AIC-2010-0463zbMath1205.68365OpenAlexW1671579239MaRDI QIDQ3568224

Clare Dixon, Lan Zhang, Ullrich Hustadt

Publication date: 17 June 2010

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-2010-0463

zbMATH Keywords

branching-time temporal logics, resolution theorem proving

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (4)

Theorem proving using clausal resolution: from past to present ⋮ A resolution calculus for the branching-time temporal logic CTL ⋮ First-Order Resolution Methods for Modal Logics ⋮ CTL-RP

Uses Software

• SPASS
• TRP++

This page was built for publication: CTL-RP: A computation tree logic resolution prover