Most Web-based Q/A systems work by finding pages that contain an explicit answer to a question. These systems are helpless if the answer has to be inferred from multiple sentences...
Stefan Schoenmackers, Oren Etzioni, Daniel S. Weld
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
Addressing queries interactively to a chain of two or more biological resources is an everyday task for many scientists, as they use in-silico methods to characterize a biological...
Jason E. Sew Hoy, Alan F. McCulloch, John R. McDon...
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...