284 search results - page 40 / 57 » Modularity of Completeness Revisited |
95
Voted
DM
1998
15 years 1 months ago
1998
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
90
Voted
TODAES
2008
15 years 1 months ago
2008
Abstract-- Automata-based methods for generating PSL hardware assertion checkers were primarily considered for use with temporal sequences, as opposed to full-scale properties. We ...
139
click to vote
LPAR
2010
Springer
15 years 10 days ago
2010
Springer
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
128
Voted
ISAMI
2010
14 years 11 months ago
2010
Many adaptative context-aware middleware exist and most of them rely on so-called vertical architectures that offer a functional decomposition for contextawareness. This architectu...
103
Voted
EMNLP
2009
14 years 11 months ago
2009
Coreference systems are driven by syntactic, semantic, and discourse constraints. We present a simple approach which completely modularizes these three aspects. In contrast to muc...