Convert the propositional statements into Conjunctive Normal Form in JAVA.
Use the algorithm given in this PDF:
http://swtv.kaist.ac.kr/courses/cs402-07/prop_logic4.pdf
The implementation must have the following classes
Solver.java: Contains the main solving method to solve a formula in conjunctive normal form. A formula is a LinkedList.
Clause.java : A clause represents disjunctions of literals. A clause is represented as a Hashmap which allows fast access to a literal with a given name.
Literal.java: A literal represents an atom that is either negated or not. An atom is basically a string of length one. If the atom is negated a prefix
Convert the propositional statements into Conjunctive Normal Form in JAVA. Use the algorithm given in this...
(b) Using the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, determine whether the following formula is satisfiable. Show each step. [3 marks] (c) Give an example of a conjunctive normal form (CNF) formula where the pure literal rule can be applied, but the unit propagation rule cannot. The formula must have at least 3 clauses. [3 marks (b) Using the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, determine whether the following formula is satisfiable. Show each step. [3 marks] (c) Give an example of a conjunctive normal form...