Artificial Intelligence208010 marksNumerical: predicate logic resolution inferencePredicate Logic
Write the rules to convert statements in predicate logic into CNF form. Convert the following sentences into FOPL. All students of BSC CSIT are intelligent person. All friends of intelligent person are smart. Laxmi is a friend of Rojina. Rojina is smart. All beautiful students are girl. Laxmi is bea
Write the rules to convert statements in predicate logic into CNF form. Convert the following sentences into FOPL. All students of BSC CSIT are intelligent person. All friends of intelligent person are smart. Laxmi is a friend of Rojina. Rojina is smart. All beautiful students are girl. Laxmi is beautiful. Using resolution algorithm infer that 'Laxmi is smart'.[10]
- Eliminate implications and biconditionals: replace $P \to Q$ with $\neg P \lor Q$, and $P \leftrightarrow Q$ with $(\neg P \lor Q) \land (\neg Q \lor P)$. 2. Move negation inward (De Morgan / quantifier duals): - $\neg(P \lor Q) \equiv \neg P \land \neg Q$ -