5084 search results - page 672 / 1017 » Proving Possibility Properties |
157
click to vote
IJCNLP
2004
Springer
16 years 4 days ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
163
click to vote
JCDCG
2004
Springer
16 years 4 days ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...
236
click to vote
LPAR
2004
Springer
16 years 4 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
182
click to vote
MFCS
2004
Springer
16 years 4 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
198
click to vote
RTA
2004
Springer
16 years 3 days ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...