36 search results - page 2 / 8 » Automated Reasoning in Reduction Rings Using the Theorema Sy... |
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
CSL
2002
Springer
13 years 5 months ago
2002
Springer
In this paper we present an approach to recognition confidence scoring and a set of techniques for integrating confidence scores into the understanding and dialogue components of ...
ALP
1994
Springer
13 years 9 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...