See http://en.wikipedia.org/wiki/Automated_theorem_proving#Decidability_of_the_problem http://en.wikipedia.org/wiki/Automated_theorem_proving#Decid... Importan

See http://en.wikipedia.org/wiki/Automated_theorem_proving#Decidability_of_the_problem http://en.wikipedia.org/wiki/Automated_theorem_proving#Decid... Important to note Gödel's completeness theorem here! You might be even more interested in Prolog, a language which has a close relationship with this stuff: "Prolog has its roots in first-order logic, a formal logic, and unlike many other programming languages, Prolog is declarative: the program logic is expressed in terms of relations, represented as facts and rules. A computation is initiated by running a query over these relations." (http://en.wikipedia.org/wiki/Prolog http://en.wikipedia.org/wiki/Prolog) This is why everyone should take an AI class.