7289 search results - page 90 / 1458 » A Dependent Set Theory |
134
click to vote
IWPEC
2009
Springer
16 years 1 days ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
147
click to vote
FUIN
2000
15 years 5 months ago
2000
The general stubborn set approach to CTL model checking 2] has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled tra...
141
click to vote
CONSTRAINTS
2010
15 years 5 months ago
2010
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
147
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
142
click to vote
ECIS
2003
15 years 6 months ago
2003
Hirschheim, Klein and Lyytinen introduced the four-paradigm theory of information systems development (ISD) as a significant attempt to systematise developer assumptions. The theo...