Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Abstract. Many processes in mathematical computing try to use knowledge of the most desired forms of mathematical expressions. This occurs, for example, in symbolic computation sys...
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...