2181 search results - page 136 / 437 » The restriction scaffold problem |
95
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
100
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
74
Voted
TASE
2008
IEEE
15 years 7 months ago
2008
IEEE
Symmetry reduction holds great promise to counter the state explosion problem. However, currently it is “conducting a life on the fringe”, and is not widely applied, mainly du...
76
Voted
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
FORMATS
2007
Springer
15 years 7 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...