CTL-RP stands for Computation Tree Logic Resolution Prover. Computation Tree Logic (CTL) is a branching-time temporal logic. CTL-RP is a resolution based theorem prover for CTL, which utilises a first-order theorem prover, SPASS, as a core engine for inference.

Please see the following link for more details.
http://cueb.science/web/software/ (if you are inside China.)
http://ctlrp.sourceforge.net (if you are not inside China.)

Project Activity

See All Activity >

Follow CTL-RP

CTL-RP Web Site

You Might Also Like
Build Securely on Azure with Proven Frameworks Icon
Build Securely on Azure with Proven Frameworks

Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of CTL-RP!

Additional Project Details

Operating Systems

Linux

Intended Audience

Science/Research

User Interface

Command-line

Programming Language

C

Related Categories

C Artificial Intelligence Software

Registered

2016-08-31