Search Results for "#sat solver"
Sort By:
Showing 17 open source projects for "#sat solver"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB 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.
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
1
Zat 1.0
Fast N-SAT solver for Windows 10
Zat is an Onagan project. It is a very fast sat solver for .cnf, .dimacs, ... Zat is an O(n^log(n)) time complexity algorithm, which is faster than O((1+e)^n) for e strictly positive. The space complexity is O(n). The version 1.0 is exclusively for Windows 10. -
2
Volunteer workshift scheduler
Volunteer workshift scheduler for a helpline service
Code written in Python finds the best possible schedule for volunteers while incorporating constrains and special requirements using CP-SAT Solver (Constraint Programming - boolean SATisfiability problem Solver). Java version is in development. The problem Arranging volunteers for a helpline service for the period of one month. There are three types of work that could be done on the same day: Phone shift: Every day. Chat shift: Mondays and Wednesdays. ... -
3
CQU
Decision solver for Counting Quantifiers over Unary Predicates
...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. At each iteration, a SAT instance is generated and a SAT Solver (minisat) decides its satisfiability. Details about CQUSAT, its normal form and this turing reduction can be found in the paper "CQUSAT.pdf" that comes with this package. ... -
4
Nigma
A CDCL SAT solver with partial backtracking
-
Forever Free Full-Stack Observability | Grafana CloudBuilt 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.
-
5
#3SAT Solver: Model Listing
Counts Satisfiable Solutions
#3SAT finds all satisfiable solutions to a 3CNF Formula. This particular solver can count or return all solutions or a hash of them in binary or Ascii format. -
6
SAT Solver
SAT Solver
SAT Solver for L3:proj 2 at ENS Lyon -
7
-
8
-
9
A modular SAT solver based on Minisat. The modules are described in XML-files, which are processed by a perl script; thus generating n-solvers.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
-
11
The Decision Procedure Toolkit (DPT) is a system of cooperating decision procedures for answering satisfiability queries. The DPT implementation in OCaml comprises a DPLL-style SAT solver with theory-specific decision procedures.
-
12
AvatarSAT is a SAT solver that uses machine-learning classifiers to automatically tune the heuristics of an off-the-shelf SAT solver on a per-instance basis.
-
13
During a course at University "La Sapienza" in Rome I developed a fully working SAT solver based on unit propagation and backtracking; it can read DIMACS files and process cnf formulas of any length(there are no restrictions on the number of literals).
-
14
-
15
This is an academic project; the main objective is to generate an algorithm to parallelize a CNF formula and then feed the distributed parts to sequential SAT solvers, for this project we have choose to use Sat4J as the solver.
-
16
NDP-blueprint-thief
Non-Deterministic Processor (NDP) - efficient parallel SAT-solver
Non-Deterministic Processor (NDP) - efficient parallel SAT-solver with unlimited linear scalability over multi-core deployments. -
17
Tiger Solver is a sat-solver written in C. Using the DPLL algorithm and reading file in DIMACS format (cnf boolean expression). Tiger Solver use most features of many important sat-solver: - Double watches list - Chronological Backtracking ....
- Previous
- You're on page 1
- Next
