7123 search results - page 265 / 1425 » The Ordered Set of Rough Sets |
137
click to vote
IPL
2011
15 years 1 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
188
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
159
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
147
click to vote
ADCM
2010
15 years 6 months ago
2010
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
175
click to vote
TCS
2008
15 years 6 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...