Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
This paper addresses the frame problem for programming theories that support both sharing and encapsulation through specification variables. The concept of dynamic frames is introd...
Temporal specification languages provide an efficient way to express events comprised of complex temporal scenarios. Assertions based on these languages are used to detect viola...
Modern approaches to speaker recognition (verification) operate in a space of “supervectors” created via concatenation of the mean vectors of a Gaussian mixture model (GMM) a...
Balaji Vasan Srinivasan, Dmitry N. Zotkin, Ramani ...
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...