Gap puzzle generator and solver using C++ and Cadical
-
Updated
Oct 12, 2020 - C++
#
sat-problem
Here are 7 public repositories matching this topic...
Reduced NP‑Hard problems such as K‑Colorability, K‑clique, Maximum clique to SAT problem using Weighted Partial Max‑SAT Input format,created using boolean formulas, in order to find a satisfying interpretation. Families are represented as vertices of a graph.
-
Updated
Nov 17, 2021 - Java
This is a simple planning problem solver that encodes a bounded planning problem as propositional logic and uses https://fmv.jku.at/limboole/ to solve it. I did this for my formal models class.
-
Updated
May 22, 2024 - C#
SAT solvers' running time prediction using graph neural networks
-
Updated
Aug 9, 2022 - Python
On the use of associative memory in Hopfield networks designed to solve propositional satisfiability problems
hopfield-network hebbian-learning self-organization self-optimization hopfield-neural-network satisfiability-problem sat-problem
-
Updated
Mar 14, 2024 - Python
-
Updated
Dec 27, 2021 - Python
This repository gathers the material of my course conclusion work (TCC) at Unisinos - theme of the work: Quantum Computing - Analysis of Quantum Algorithms for Solving the SAT Problem in the NISQ Era
-
Updated
Jul 1, 2024 - Jupyter Notebook
Improve this page
Add a description, image, and links to the sat-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sat-problem topic, visit your repo's landing page and select "manage topics."