pure-literal-elimination

Here are 2 public repositories matching this topic...

Propositional theorem prover - resolution with pure literal elimination and subsumption elimination, implemented in ISO Prolog. Educational software.

This project is a satisfiability checker that works with formulas in conjunctive normal form.

Add a description, image, and links to the pure-literal-elimination topic page so that developers can more easily learn about it.

To associate your repository with the pure-literal-elimination topic, visit your repo's landing page and select "manage topics."