Sciweavers

7289 search results - page 90 / 1458
» A Dependent Set Theory
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
Partitioning into Sets of Bounded Cardinality
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...
Mikko Koivisto
FUIN
2000
85views more  FUIN 2000»
13 years 7 months ago
Stubborn Sets for Model Checking the EF/AG Fragment of CTL
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...
Karsten Schmidt 0004
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 8 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
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...
Hadrien Cambazard, Barry O'Sullivan
ICALP
2005
Springer
14 years 1 months ago
Combining Intruder Theories
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...
Yannick Chevalier, Michaël Rusinowitch
ECIS
2003
13 years 9 months ago
A qualitative approach to investigating the behavioural definitions of the four-paradigm theory of information systems developme
Hirschheim, Klein and Lyytinen introduced the four-paradigm theory of information systems development (ISD) as a significant attempt to systematise developer assumptions. The theo...
Donal J. Flynn, Zahid I. Hussain