A simple combinatorial boolean sat solver based on the AC-3 Algorithm

První projekt z předmětu IZLO.

A SAT solver for propositional clauses in cnf form

CryptoMiniSat rust bindings

Using a SAT solver to prove correctness of schedules given a list of constraints.

Code and text for the suspended paper/project "Predicting Satisfiability of Benchmark Instances".

SudokuAreEz-SAT are project implement Mathematics Logic using Boolean Satisfiability to solve Sudoku puzzle.

Model the card game Yaniv in predicate logic. Project for Queen's University course CISC/CMPE 204: Logic for Computing Science.

Yet another SAT solver developed in C.

Solving the N-Queens Problem Using a SAT Solver

A DPLL-based SAT solver focused on traceability

A SAT solver. It's maybe kinda fast and correct?

DPLL_propositional_logical_inference: Starting from a FNC (Conjunctive Normal Form), that is, a series of clauses (literals joined by the or operator) joined by an and operator. Apply the DPLL algorithm and determine the values ​​of the literals that give a solution to the FNC. A clear explanation of the DPLL algorithm can be found at http://www…

🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python

📈 Implementation of a SAT solver to solve satisfiability problems.

SAT_propositional_logical_inference Obtaining the satisfaction of a knowledge base by a different procedure from the conventional one. Currently, it is usually passed from an expression in FBF (well-formed formula with literals separated by the connectors =>, <=> , v, ^, ¬ and parentheses) to an expression in FNC composed of clauses (literals se…

BFS-no-conventional Search according to the BFS algorithm according to an "unconventional" method, meaning the conventional one that is downloaded from http://www.paulgraham.com/acl.html link to code file acl2.lisp. In this "unconventional" version, all the paths that lead to the objective are obtained following the BFS strategy, not only the fi…

Tool to check if a conditional behavior tree (CBT) is valid