A Rust library to transform integer and pseudo Boolean constraints into conjunctive normal form
-
Updated
Apr 17, 2026 - Rust
#
sat-encodings
Here are 8 public repositories matching this topic...
Source Code and Evaluation Data of the paper 'SAT Encodings of the At-Most-k Constraint - A Case Study on Configuring University Courses'
-
Updated
Mar 7, 2024 - HTML
A SAT-based C/C++ solver for the Resource-Constrained Project Scheduling Problem with General Precedence Relations (RCPSP-GPR)
c cpp scheduling constraint-satisfaction-problem project-management constraint-programming sat satisfiability rcpsp sat-encodings project-scheduling
-
Updated
Oct 15, 2025 - C
-
Updated
Mar 24, 2026 - Java
A verified constructive reduction of the Cook-Levin Theorem in Lean 4.
computer-science mapping turing-machine formal-verification symbolic-computation interactive-theorem-proving boolean-logic complexity-theory mathlib leanprover injective constructive-mathematics sat-encodings lean4 np-complete-problems cook-levin
-
Updated
Apr 19, 2026 - Lean
MSc CS thesis (2 published papers)
-
Updated
Mar 28, 2025 - Python
Provide a verified, machine-checked constructive reduction of the Cook-Levin theorem from Turing machines to SAT formulas using Lean 4.
computer-science mapping turing-machine formal-verification symbolic-computation interactive-theorem-proving boolean-logic complexity-theory mathlib injective constructive-mathematics sat-encodings np-complete-problems cook-levin
-
Updated
May 2, 2026 - Lean
Improve this page
Add a description, image, and links to the sat-encodings topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sat-encodings topic, visit your repo's landing page and select "manage topics."