constraint-solving

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

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

Computational invention engine with Forge: builds software from natural-language requirements, runs it in isolation, and packages only independently validated builds.

A high-performance, custom-rendered FMX component for Delphi that provides a fluid, physics-based list interface. Built entirely on the Skia4Delphi graphics pipeline, it breaks away from traditional UI constraints to deliver a smooth, modern, and highly interactive user experience.

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

C³: Calculus of Constrained Constructions. Sovereign alternative to SMT/Haskell from first principles. Menhir · Rascal · Scala 3 · Dex · Aldor · MPL.

Android word puzzle: a grid of letters, a list of word lengths, and exactly one way to tile it. Kotlin + Compose, with a board generator that proves uniqueness before shipping a puzzle.

A CDCL SAT solver written in OCaml. The solver reads standard DIMACS CNF files and applies watched literals, clause learning, and restarts. A Sudoku encoder turns puzzles into CNF as a demo. The test suite checks every reported model with an independ

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

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.

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.

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.

An algorithm for solving the wordle.

Neuro-symbolic Wordoku solver with PyTorch-guided, contradiction-pruned beam search.

Generate, validate, repair, publish pipeline for AI training plans. The LLM proposes, deterministic code decides whether it ships. Resolves every constraint violation at zero LLM calls.

A puzzle-gated birthday site — six locked chapters, ten arcade games, and a whodunnit that generates its own solvable logic puzzles. React + Vite PWA.

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.

A semantic DSL for comic panels, compiled to SVG. Deterministic geometry and constraint solving, no generative image model. Deliberately AI-generated: a training ground for working with AI coding tools.