SCHOOL OF COMPUTER SCIENCE – Colloquium Series
The School of Computer Science at the University of Windsor is pleased to present…
Colloquium Presentation by Dr. David E. Narvaez
Time: 11:00am – 12:00pm
Location: Erie Hall, Room 3123
Reminder: Two-part attendance required: Part I (Scan the QR code, fill in online form) and Part II (sign in sheet). *Make sure you are in the room at least 5-10 minutes BEFORE the presentation starts – once the presentation has begun, latecomers will not be admitted.
Abstract:
The πPR proof system for unsatisfiable Boolean formulas is an improvement over the PR proof system that allows for specifying not only a
witness assignment but also a permutation of variables that, together with the witness, justifies the redundancy of a clause. The pprsearch tool allows for finding such a permutation based on a graph representation of the CNF formula.
Keywords: SAT, Proof Systems, Graph Isomorphism
Biography:
I am postdoc working under the supervision of Lane Hemaspaandra in the intersection of computational complexity and computational social choice. I finished my PhD at RIT under the supervision of Edith Hemaspaandra and Stanisław P. Radziszowski on the topic of constraint satisfaction techniques for combinatorial problems. I did my BS in Computer Systems Engineering at UTP (I am, as a matter of fact, from Panama) and my MS in Computer Science at RIT.
5113 Lambton Tower 401 Sunset Ave. Windsor ON, N9B 3P4 (519) 253-3000 Ext. 3716 csgradinfo@uwindsor.ca