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
AI-powered service management for IT and enterprise teams Icon
AI-powered service management for IT and enterprise teams

Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
Try it 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