58 search results - page 7 / 12 » Metric-Entropy Pairs on Lattices |
CORR
2000
Springer
13 years 7 months ago
2000
Springer
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 9 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
EJC
2010
13 years 7 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
ORDER
2002
13 years 7 months ago
2002
For a given class T of compact Hausdorff spaces, let Y(T ) denote the class of -groups G such that for each g G, the Yosida space Y (g) of g belongs to T . Conversely, if R is a c...
COMBINATORICS
2006
13 years 7 months ago
2006
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...