Logic for Computer Science course projects
-
Updated
Dec 13, 2019 - OCaml
Logic for Computer Science course projects
Propositional theorem prover using the tableaux method and FOL theorem prover using resolution
Assignments for the course COL703 — Logic for Computer Science @ IIT Delhi.
Simple proof assistant written in OCaml.
PoC compiler for the Incredible Proof Machine (http://incredible.pm)
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
A tiny implementation of logical resolution.
A SAT solver for propositional clauses in cnf form
Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.
Add a description, image, and links to the propositional-logic topic page so that developers can more easily learn about it.
To associate your repository with the propositional-logic topic, visit your repo's landing page and select "manage topics."