16 search results - page 2 / 4 » Structural theorems for symbolic summation |
CADE
2009
Springer
14 years 6 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discre...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
AIIA
1991
Springer
13 years 9 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
MKM
2004
Springer
13 years 11 months ago
2004
Springer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...