11151 search results - page 1836 / 2231 » On the Complexity of Model Expansion |
198
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
175
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
178
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
173
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
271
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...