Do Portfolio Solvers Harm? Christoph Weidenbach Max Planck Insitute for Informatics Saarland Informatics CampusSaarbr¨ ucken, Germany

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Formal methods
• Automated reasoning
• Constraint programming
• Automated theorem proving
• Satisfiability modulo theories
• Solver
• Answer set programming
• Satz
• Model checking
• Algorithm selection

PWN Xerox Printers (…again) About Hardware Attacks and (In-) Secure Cloning Fraunhofer FKIE Peter Weidenbach, Raphael Ernst Abstract

Source URL: www.fkie.fraunhofer.de

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Source URL: resources.mpi-inf.mpg.de

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Source URL: resources.mpi-inf.mpg.de

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Source URL: resources.mpi-inf.mpg.de

• Theoretical computer science
• Mathematical logic
• Mathematics
• Logic programming
• Logic in computer science
• Automated theorem proving
• Formal methods
• Unification
• Lambda calculus
• Constraint logic programming
• Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning II”

Source URL: resources.mpi-inf.mpg.de

• Logic
• Logical truth
• Mathematical logic
• Theoretical computer science
• Model theory
• Automated theorem proving
• Logic programming
• Philosophy of logic
• Satisfiability
• Substitution
• Boolean satisfiability problem

Heidi Weidenbach-Mattar Ständige Vertreterin des Generalsekretärs der KMKgeboren in Gevelsberg/Nordrhein-Westfalen verheiratet, zwei Söhne

Source URL: www.kmk.org

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Source URL: resources.mpi-inf.mpg.de

• Automated theorem proving
• Model theory
• Formal methods
• Constraint programming
• Resolution
• Skolem normal form
• Lambda calculus
• Satisfiability
• Boolean satisfiability problem
• Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Source URL: resources.mpi-inf.mpg.de

• Logic programming
• Automated theorem proving
• Logic in computer science
• Formal methods
• Theoretical computer science
• Unification
• Lambda calculus
• Boolean satisfiability problem
• Conjunctive normal form