Module 2

meta equivalence

two propositional sentences are meta equivalent if the truth values of each proposition is the same.

Every propositional sentence can be rewritten in conjunctive normal form using rewrite rules.

It is faster for a computer to show that a knowledge base entails a set of sentences than to show that a knowledge base does not entail a set of sentences.

To show that the knowledge base resolves to false, show that it entails to false.

Docs just now