This course covers the learning outcomes and goals of tractable FO model checking. It teaches skills such as interpreting bounded TwinGraph formulas, understanding magnetic stability, and applying dynamic programming. The teaching method includes lectures on topics like trigraphs, contraction sequences, and Hamiltonian paths. The intended audience for this course is individuals interested in formal methods, logic, and algorithmic verification.
Overview
Syllabus
Introduction
Trigraphs
contraction sequence
something more
unit interval
ktman graphs
Hamiltonian path
Bounded Twin
Graph Formula Checking
Interpretations
Magnetic stability
FO model checking
Dynamic programming
Taught by
IEEE FOCS: Foundations of Computer Science
