36 search results - page 7 / 8 » Abstract Branching for Quantified Formulas |
JELIA
1990
Springer
14 years 23 days ago
1990
Springer
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...
MKM
2005
Springer
14 years 2 months ago
2005
Springer
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...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
JSAT
2006
13 years 8 months ago
2006
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...
TMI
2010
13 years 3 months ago
2010
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...