Topics in Automated Theorem Proving (236 714): WS 2013/14
Homepage:
http://cs.technion.ac.il/~janos/COURSES/THPR/index.html
Old Homepage 2006/7:
http://cs.technion.ac.il/~janos/COURSES/THPR/index20067.html
Notes on logic
Slides of Lecture 2 (revised October 24, 2013)
Slides of Lecture 3 (posted November 1, 2013)
Slides of Lecture 4 and 6 (posted November 23, 2013), without Lecture 5
Slides of Lecture 7 (posted November 23, 2013, on Geometry)
Slides of Lecture 8 (posted December 23, 2013, on QE in ACF_0)
Course material from 2003:
Old Lecture notes
Chapter 3 of the book
with proof of Tarski's theorem.
Lecturer: Prof. J.A. Makowsky
Taub 628, Tel: 4358, email: janos@cs
Format: 2 hours lecture + 1 hour tirgul
NEW TIME AND LOCATION
Lecture: Thursday 10:3012:30 (Starting October 17)
Tirgul: Thursday 09:3010:30 (starting October 24)
Place: Taub 4
Last given:
By J.A. Makowsky (2006/7, 2003, 1989/90), by Monty Newborn (1992/93)
Prerequisites:
Logic for CS (234 292) or Set Theory and Logic (234 293)
Course outline:
Automated theorem proving is used in two rather different ways.
Universal formalisms are used in Artificial Intelligence
and Databases to automatize deductive systems in general data and
knowledge processing. The Highly specialized formalisms are used
in well structured applications such as computational geometry
and other branches of computer aided mathematics.
We shall study both approaches in a certain depth.

Theorem proving and computer aided mathematics.
General problem solvers vs Special problem solvers.
Guiding problem: Classical geometry.

Propositional theorem proving: Solving SAT
Resolution methods:
Analysis of worst case, average case, heuristics.
Other methods

First Order Logic and Theorem proving.
Resolution and Unification.

Equational logic.

Classical geometry.
Course goal:
Exploring the achievements of automated theorem proving.
Introducing topics for
M.Sc. and Ph.D. theses.
Course requirements:
Four homework assignements.
Projects or take home exam.
Literature:
No single textbook covers our approach.
The most updated reference is:

A. Robinson and A. Voronkov, eds
Handbook of Automated Reasoning, vol. 1 and 2
The MIT Press and North Holland
Our course takes material from volume 1:
Chapters 1, 2, 8, 9, 11, 12
Additional references:

Recent papers of interest, to be posted when relevant.

ShangChing Chou, Mechanical Geometry Theorem Proving,
Reidel, 1988

WenTsuen Wu, Mechanical Theorem proving in Geometries, Springer 1994

B.F. Caviness and J.R. Johnson (eds),
Quantifier Elimination and Cylindrical Algebraic Decomposition,
Springer 1998