2181 search results - page 134 / 437 » The restriction scaffold problem |
91
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
123
click to vote
CADE
2005
Springer
16 years 1 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...
85
Voted
AEI
2007
15 years 26 days ago
2007
Data mining mechanisms have widely been applied in various businesses and manufacturing companies across many industry sectors. Sharing data or sharing mined rules has become a tr...
118
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
99
Voted
ALGORITHMICA
2002
15 years 18 days ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...