This library contains tools for representing clause sets and more general boolean formulas as well as for representing SMT (satisfiability modulo theory) formulas. In addition, a set of tools is included for generating tries of the prime implicates of boolean formulas. Current work includes integrating SMT formuals with these prime implicate generation tools so that prime implicates of SMT formulas may be produced.

For a list of publications relating to this project, go to
Files -> publications

Project Activity

See All Activity >

Follow PLOOPI-Lib

PLOOPI-Lib Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of PLOOPI-Lib !

Additional Project Details

Registered

2014-02-23
Report inappropriate content