This assignment covers key topics in logic, theorem proving, and knowledge representation relevant to Artificial Intelligence.
-
Updated
May 27, 2025 - Prolog
#
cnf
Here are 5 public repositories matching this topic...
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.
university logic prolog logic-programming cnf conjunctive-normal-form logic-in-computer-science prolog-rules
-
Updated
Feb 14, 2018 - Prolog
Sat-Solver is a Prolog program that converts propositional logic formulas into CNF and solves them using the DPLL algorithm. It processes logical expressions and applies unit propagation, clause simplification, and variable branching. The project was mainly built to improve skills in Prolog.
-
Updated
Feb 25, 2025 - Prolog
A GNU Prolog programme to convert boolean expressions into CNF.
-
Updated
Jun 13, 2021 - Prolog
Improve this page
Add a description, image, and links to the cnf topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the cnf topic, visit your repo's landing page and select "manage topics."