Search Results for "disjunctive normal form boolean"

Showing 6 open source projects for "disjunctive normal form boolean"

View related business solutions
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • 1
    Fully Homomorphic Encryption

    Fully Homomorphic Encryption

    An FHE compiler for C++

    ...At its core is a “transpiler” that converts ordinary functions (typically written in a restricted subset of C++ or similar) into FHE circuits, plus backends that execute those circuits with different FHE libraries. The workflow usually mirrors normal software development: write and test a cleartext implementation, run a simulator to validate logic and performance characteristics, then compile to an encrypted form to run with real FHE parameters. The project includes benchmarking harnesses, examples, and tutorials that demystify parameter selection, gate costs, and latency/throughput trade-offs. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    CQU

    Decision solver for Counting Quantifiers over Unary Predicates

    ---------------- cqusat 1.0 ---------------- cqusat is a conbstraint solver decides the satisfiability of a set of sentences containing Counting Quantifiers over Unary predicates. It also accepts Universally quantifies sentences over unary predicates, which are presented in the form of propositional clauses (classical Boolean logic clauses). This implementation employs minisat as the SAT solver. It also emplouys COIN-OR Clp linear programming solver, and inherit from it. Given a CQUSAT instance in normal form as input, the program returns a solution, if there is one. The implemented method employs dual Simplex Algorithm with Column Generation. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    Logic Calculator

    A Calculator to perform logical operations

    .... (3) Conversion of a formula to Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF): In this mode the user inserts a logic formula and the Logic Calculator outputs its representation in both a DNF and CNF.
    Leader badge
    Downloads: 48 This Week
    Last Update:
    See Project
  • 4

    BBNanalysis

    Bayesian Belief Network Analysis & Validation

    A tool for analysis of Bayesian Belief Networks/Decision Networks in Genie 2.0 (.xdsl) format. Developed as a part of the HELICOPTER project (http://www.helicopter-aal.eu).
    Downloads: 0 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    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 security. Auth0 now, thank yourself later.
    Try free now
  • 5
    Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    CNF-toolkit is a simple library for constructing and manipulating boolean formulae in conjunctive normal form.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next