Introduction Artificial Intelligence (AI) is the area of computer science focusing on

creating machines that can engage on behaviors that humans consider intelligent. The
ability to create intelligent machines has intrigued humans since ancient times, and
today with the advent of the computer and 50 years of research into AI programming
techniques, the dream of smart machines is becoming a reality. Researchers are
creating systems which can mimic human thought, understand speech, beat the best
human chess player, and countless other feats never before possible.
What is Artificial Intelligence (AI)? According to Elaine Rich, Artificial Intelligence
Artificial Intelligence is the study of how to make computers do things atwhich, at
the moment, people are better.

Definition...
Artificial Intelligence is a branch of Science which deals with helping machines find
solutions to complex problems in a more human-like fashion. This generally involves
borrowing characteristics from human intelligence, and applying them as algorithms in
a computer friendly way. A more or less flexible or efficient approach can be taken
depending on the requirements established, which influences how artificial the
intelligent behaviour appears.
AI is generally associated with Computer Science, but it has many important links with
other fields such as Maths, Psychology, Cognition, Biology and Philosophy, among many
others. Our ability to combine knowledge from all these fields will ultimately benefit
our progress in the quest of creating an intelligent artificial being.
WHAT IS THEOREM PROVING?
Reasoning by theorem proving is a weak method, compared to experts systems, because
it does not make use of domain knowledge. This, on the other hand, may be a strength,
if no domain heuristics are available (reasoning from first principles). Theorem
proving is usually limited to sound reasoning.
Differentiate between
theorem provers: fully automatic
proof assistants: require steps as input, take care of bookkeeping and sometimes
'easy' proofs.
Theorem proving requires
a logic (syntax)
a set of axioms and inference rules
a strategy on when how to search through the possible applications of the axioms
and rules
Examples
of
axioms
p
->
(q->p)
(p->(q->r))
->
((p->q)
->(p->r))
p
\/
~p
p->(~p->q)
Notation: I use ~ for "not", since it's on my keyboard.
theorem provingapplying rules of inference directly to the sentences
in our knowledge base to construct a proof of the desired sentence without consulting

models.
If the number of models is large but the length of the proof is short, then theorem
proving
can
be more efficient than model checking.