Algorithms Seminar
Selected Refutations in Clausal and Polyhedral Systems
Thursday, June 5,
-
Speaker(s): K Subramani, West Virginia University
Abstract
This talk is concerned with providing certificates for constraint satisfaction problems. Certification enhances trust in the answers returned by an implementation. Of late, certification has become an integral part of Explainable AI. We will discuss the existence of certificates in both polyhedral and clausal systems. A secondary aspect of our research concerns finding certificates of optimal length. We will present research results in this domain, obtained over the last two decades.
Speaker Bio
K Subramani is a Professor of Computer Science in the Lane Department of Computer Science and Electrical Engineering at West Virginia University. He received his PhD in Computer Science from the University of Maryland at College Park in 2000. He worked at Larsen & Toubro as a database designer from January 1993 through July 1993. His first research job was that of an algorithm designer at Glaxo-Wellcome where he was involved with graph isomorphism problems. This was followed by a long stint at Cadence Design Systems as a VLSI engineer.