Brute force sat solver in OpenCL

A simple SAT solver written in Java

Command line tool for SAT solving, SMT solving in various theories (NRA, LRA, LIA, EQ, EQUF, BV)

A Repair Framework for Alloy

Experimental Java interpreter written in Java

Simple Java implementation of the Davis–Putnam–Logemann–Loveland (DPLL) algorithm

EstiMate 🦉: A fast and accurate modelcounter tool for estimating the number of models for LTL formulas using transfer matrices.

Implementation of the Davis-Putnam algorithm to solve a simple form of an adventure game. The puzzle includes (1) a maze with treasures at particular nodes; (2) a maximum number of steps; A player gets all the treasures at the node travelled to. The object is to find a path through the maze that collects all the different types of treasure.

A Sketching Framework for Alloy

A teaching aid for concepts and algorithms in logic

Improved Apriori-algorithm using a Sat-Solver

Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.

SAT solver using java. Implementing few strategies like elitism, tournament, dynamic crossover andmore.

Generator for CNF'S considering the variance by using model counting with #sat

Optimized SAT-based approach for university course timetabling. Handles large datasets, ensuring efficient and conflict-free scheduling. Developed and optimizing in ESLab

University algorithm-oriented project that accurately detects complex networks of influential mafia families represented as vertices and edges of rare graphs. The algorithms are being reduced to the Satisfiability Problem using a boolean formula that will be evaluated by an SAT Solver, deciding whether the initial clause has been satisfied or not.

Builds random configurations/models using a CNF and installation rates

My Graduate Thesis 2024 - University of Engineering and Technology

Implementation of n x n SAT Sudoku solver using minisat

A recursive algorithm with backtracking in Java to solve the NP problem of SAT solving.