This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject for the first time. Both Gentzen-style sequent calculi and the refutation method known as resolution are treated in detail. Various strategies for pruning resolution search spaces, such as linear, hyper- and ordered resolution are covered. Numerous examples are presented to illustrate the examples discussed. As a result students will find this a readily accessible introduction to this subject.
