111 search results - page 13 / 23 » The eskolemization of universal quantifiers |
ACS
2002
13 years 7 months ago
2002
cal Abstract Algebraic Logic: Algebraizable Institutions To Don Pigozzi this work is dedicated GEORGE VOUTSADAKIS Department of Mathematics, Iowa State University, Ames, IA 50011 U...
COMPUTER
2002
13 years 7 months ago
2002
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
INFSOF
1998
13 years 7 months ago
1998
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
TON
2010
13 years 6 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...