92 search results - page 1 / 19 » Generic compactness reformulated |
AML
2004
13 years 10 months ago
2004
We point out a connection between reflection principles and generic large cardinals. One principle of pure reflection is introduced that is as strong as generic supercompactness of...
CONSTRAINTS
2008
13 years 11 months ago
2008
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
APAL
2010
13 years 11 months ago
2010
I use generic embeddings induced by generic normal measures on P() that can be forced to exist if is an indestructibly weakly compact cardinal. These embeddings can be used in or...
CPAIOR
2009
Springer
14 years 5 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...