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 to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start Free
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