Script 01 [PDF]

Script 02 [PDF]

Script 03 [PDF]

Script 04 [PDF]

Script 01 - 04 with corrections [PDF]

Script 05 [PDF]

Script 06 [PDF]

Script 01 - 07 with corrections [PDF]

Script 01 -07 further corrections [PDF]

Script 08 [PDF]

Script 09 including extensions to 08 [PDF]

Script 10 including extensions to 09 [PDF]

Script 11 chapters2,3 with corrections [PDF]

Sample Solution to the Leonardo puzzle [dfg]


  • English-German dictionary of deduction-related terms: [pdf]  [ps]

Course material from other lectures

Propositional logic, first-order logic, tableaux calculi

  • Melvin Fitting:
    First-Order Logic and Automated Theorem Proving.
    Springer-Verlag, New York, 1996.
  • Uwe Schöning:
    Logik für Informatiker.
    Spektrum Akademischer Verlag, 2000
  • Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh (Editors)
    Handbook of Satisfiability
    IOS Press, 2009
  • Uwe Schöning, Jacobo Torán:
    The Satisfiability Problem - Algorithms and Analyses
    Lehmanns Verlag, 2013

Termination, well-founded orderings, confluence, unification

  • Franz Baader and Tobias Nipkow:
    Term Rewriting and All That.
    Cambridge Univ. Press, 1998

Further readings

  • Leo Bachmair and Harald Ganzinger
    Resolution Theorem Proving, in "Handbook of Automated Reasoning", pages 19-99.
    Elsevier, 2001.
  • Robert Nieuwenhuis and Albert Rubio
    Paramodulation-Based Theorem Proving, in "Handbook of Automated Reasoning", pages 371-443.
    Elsevier, 2001.
  • Andreas Nonnengart and Christoph Weidenbach
    Computing small clause normal forms, in "Handbook of Automated Reasoning", pages 335-367.
    Elsevier, 2001.
  • Christoph Weidenbach
    Combining Superposition, Sorts and Splitting, in "Handbook of Automated Reasoning", pages 1965-2012.
    Elsevier, 2001.