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

You Might Also Like
Our Free Plans just got better! | Auth0 by Okta Icon
Our Free Plans just got better! | Auth0 by Okta

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Try free now
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