LTL model checker for lasso paths
A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.
Solving the classic Ferryman problem via model-checking using NuSMV Modeller
Converting formula into CNF using rules. Created at the University as the project within Logic in Computer Science classes in 2016. The purpose of this project was to learn converting formulas into CNF based on Prolog's rules.
Solutions of Logic in Computer Science problems in Proloh.
The Assignment 2 of the CS F214 course, Logic In Computer Science
Add a description, image, and links to the logic-in-computer-science topic page so that developers can more easily learn about it.
To associate your repository with the logic-in-computer-science topic, visit your repo's landing page and select "manage topics."