7988 search results - page 266 / 1598 » A Useful Undecidable Theory |
191
click to vote
AISC
2010
Springer
15 years 5 months ago
2010
Springer
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
134
Voted
COSIT
1999
Springer
15 years 5 months ago
1999
Springer
We extend the theory about terminological default reasoning by using a logical base language that can represent spatioterminological phenomena. Based on this description logic lang...
124
click to vote
LPNMR
1999
Springer
15 years 5 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
91
Voted
EUROCAST
1997
Springer
15 years 5 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
HYBRID
1997
Springer
15 years 5 months ago
1997
Springer
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...