4066 search results - page 305 / 814 » Almost Complete Sets |
185
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
175
click to vote
ENTCS
2007
15 years 6 months ago
2007
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
173
click to vote
NLE
2008
15 years 6 months ago
2008
Morphological analysis is a crucial component of several natural language processing tasks, especially for languages with a highly productive morphology, where stipulating a full ...
164
click to vote
NJC
2006
15 years 6 months ago
2006
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
160
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...