Browse by Discipline
Ragde, Prabhakar - School of Computer Science, University of Waterloo
Program verification Readings: Chapter 4.
A Fixed-Parameter Approach to Two-Layer Planarization ?
On graph powers for leaf-labeled trees Naomi Nishimura * Prabhakar Ragde y
Embeddings of k-connected graphs of pathwidth k ?
Fast xed-parameter tractable algorithms for nontrivial generalizations of vertex cover
The semantics of predicate logic Readings: Section 2.4, 2.5, 2.6.
Readings: Section 2.7. In this module, we look at Alloy, an analyzer that uses a simple
Logic Programming Having just studied the use of Alloy as a tool for checking
Going beyond propositional logic Consider the following statements
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan.
Topics in propositional logic Readings: None from the textbook.
Formalization Readings: None.
Faster fixed-parameter tractable algorithms for matching and packing problems
Natural deduction for predicate logic Readings: Section 2.3.
Naomi Nishimura Prabhakar Ragde Stefan Szeider
Propositional logic Readings: Sections 1.1 and 1.2 of Huth and Ryan.
Welcome to CS 245 Instructor: Brad Lushman
Website Policies/Important Links