1888 search results - page 56 / 378 » Proof theory and computational analysis |
111
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
111
Voted
ICASSP
2010
IEEE
15 years 19 days ago
2010
IEEE
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
116
Voted
AI
2008
Springer
14 years 11 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
126
Voted
CADE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
118
Voted
IMCSIT
2010
14 years 10 months ago
2010
In the present text, we deal with the problem of classification of speech emotion. Problems of speech processing are addressed through the use of artificial neural networks (ANN). ...