111 search results - page 11 / 23 » The eskolemization of universal quantifiers |
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
BIBE
2003
IEEE
14 years 1 months ago
2003
IEEE
Currently there are little objective parameters that can quantify the success of one form of prostate surgical removal over another. Accordingly, at Old Dominion University (ODU) ...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
EACL
2009
ACL Anthology
14 years 8 months ago
2009
ACL Anthology
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...