Home
Schedule
Assignments
Projects
Handouts
 
Blackboard
 
fp@cs
Frank Pfenning
  

15-815 Automated Theorem Proving
Handouts

The handout Automated Theorem Proving contains a complete set of notes as of the indicated date. This includes all incremental handouts with possible corrections and updates. Note that I do not correct incremental handouts on-line.

Files are available in PDF format (soon) and also in PostScript (additional link). Some external papers are not available electronically.

Date Handout (PDF) PostScript Note
Apr 13 Automated Theorem Proving atp.ps Chs.1-7, Lectures 1-12, 14-20
Jan 20 Ch.1 Introduction ch1-intro.ps Lecture 1
Jan 20 Ch.2 Natural Deduction ch2-natded.ps Lectures 1, 2, 4
Jan 22 Ch.3 Sequent Calculus ch3-seqcalc.ps Lectures 2, 3, 4
Feb 9 Ch.3.7 Classical Sequent Calculus ch37-classical.ps Lectures 6, 7
Feb 13 Ch.5 The Inverse Method ch5-inverse.ps Lecture 8
Feb 27 Ch.4.3 Unification ch43-unif.ps Lecture 10
Feb 29 Ch.4.4 Unification with Parameters ch44-unifparm.ps Lecture 11
Feb 29 Ch.5.7-5.8 First-Order Inverse Method ch57-foinv.ps Lecture 12
Mar 22 Ch.4 Focusing ch4-focus.ps Lectures 10, 11, 14, 15
Mar 29 Ch.5.9 Inverse Focusing ch59-invfocus.ps Lecture 16
Apr 4 Ch.6 Labeled Deduction ch6-label.ps Lectures 17, 18, 19
Apr 6 Ch.7 Equality ch7-equality.ps Lecture 20

Papers and Reports

[D92] Roy Dyckhoff.
Contraction-free sequent calculi for intuitionistic logic.
Journal of Symbolic Logic, 57:795-807, 1992.
[DN00] Roy Dyckhoff and Sara Negri.
Admissibility of structural rules for contraction-free systems of intuitionistic logic.
Journal of Symbolic Logic, 65:1499-1518, 2000.
[DV01a] Anatoli Degtyarev and Andrei Voronkov.
The inverse method.
Handbook of Automated Reasoning, Volume 1, pp.179-272, Elsevier Science and MIT Press, 2001.
Corrigendum for pp.200-201.
[J98] Jacob Howe.
Proof Search Issues in Some Non-Classical Logics.
Ph.D. Thesis, University of St. Andrews, Scotland.
[W01] Arild Waaler.
Connections in nonclassical logics.
Handbook of Automated Reasoning, Vol.2, pp.1487-1578, Elsevier Science and MIT Press, 2001.
[KS00] Christoph Kreitz and Stephan Schmitt.
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems.
Information & Computation 162(1-2), pp.226-254, 2000.
[NR01] Robert Nieuwenhuis and Alberto Rubio.
Paramodulation-based theorem proving.
Handbook of Automated Reasoning, Vol.1, pp.371-444, Elsevier Science and MIT Press, 2001.
[T98] Tanel Tammet.
Towards Efficient Subsumption.
Proceedings of the 15th International Conference on Automated Deduction, C.Kircher and H.Kirchner, eds., pp.427-441, Springer-Verlag LNAI 1421, 1998.
[RSV01] I.V. Ramakrishnan, R. Sekar, and Andrei Voronkov.
Term Indexing.
Handbook of Automated Reasoning, Vol.2, pp 1853-1965, Elsevier Science and MIT Press, 2001.
[DP01] Nachum Dershowitz and David A. Plaisted.
Rewriting.
Handbook of Automated Reasoning, Vol.1, pp.537-610, Elsevier Science and MIT Press, 2001.
[BGV98] Leo Bachmair, Harald Ganzinger, and Andrei Voronkov.
Elimination of Equality via Transformation with Ordering Constraints.
Proceedings of the 15th International Conference on Automated Deduction, C.Kircher and H.Kirchner, eds., pp.175-190, Springer-Verlag LNAI 1421, 1998.
[BTV03] Leo Bachmair, Ashish Tiwari, and Laurent Vigneron.
Abstract Congruence Closure.
Journal of Automated Reasoning, 31:129-168, 2003.
[G02] Harald Ganzinger.
Shostak Light.
Proceedings of the 18th International Conference on Automated Deduction, A.Voronkov, ed., pp.332-346, Springer-Verlag LNAI 2392, 2002.

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

fp@cs
Frank Pfenning