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 >

Categories

Artificial Intelligence

Follow CTL-RP

CTL-RP Web Site

Other Useful Business Software
Crowdtesting That Delivers | Testeum Icon
Crowdtesting That Delivers | Testeum

Unfixed bugs delaying your launch? Test with real users globally – check it out for free, results in days.

Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
Click to perfect your product now.
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
Report inappropriate content