A webassembly wrapper for FreeCAD's 2D geometric solver.

An implementation of miniKanren which provides support for Constraint Handling Rules (CHR)

Universal dependency resolver using SAT solvers - works for software packages, course prerequisites, books, certifications, and any system with logical dependencies

Constraint solving vs Abstract interpretation

This repository contains projects and assignments completed for the Constraint Solving course at KU Leuven.

AVX-512 native constraint engine: CPU beats GPU at 35.9B checks/sec

Contradiction-native research runtime for verifier-backed ontology revision, structural abstraction invention, and replayable proof artifacts.

SATzillaX is a high-performance CDCL SAT Solver built in C++17 featuring Two-Watched Literals, VSIDS branching heuristic, Phase Saving, Clause Learning, Non-Chronological Backtracking, and Geometric Restarts.

Certified frame-first SAT middleware — decide structured regions (2-SAT · GF(2) parity · counting) before CDCL, and independently verify every verdict (model replay · DRAT). A research harness for where SAT hardness lives.

Unit-safe SAT/UNSAT verifier for speculative city claims, with minimal conflict sets.

Constraint solving approaches in Guile Scheme, inspired by Hillel Wayne's article. Features native CSP engine, Z3 SMT solver integration, and comparison of different solving approaches for classic problems.

Verified AI reasoning SDK — formal verification layer between LLMs and constraint solvers

Python library for program synthesis and symbolic execution combining constraint solving and LLMs

An algorithm for solving the wordle.

🤖 Intelligent Wordle AI Bot with constraint-solving algorithm. Features smart decision-making, multi-game modes, 527-word vocabulary, and 100% test coverage. Ready for production deployment with Docker and CI/CD.

Visualize the classic N-Queens puzzle 👑 in real time using AI search algorithms — Hill Climbing, Simulated Annealing, and Local Beam Search. Built with Python, Pygame, and NumPy, it beautifully animates how AI solves complex constraint problems step by step.

Assignment-selection merge algorithms and constraint models

Solves a riddle using a constraint solving programming backtracing approach

DIMACS CNF toolkit for Max-SAT and SAT optimization

Snake AI with Hamiltonian safety invariant and real-time cycle mutation for safe path optimization.