2516 search results - page 13 / 504 » When is there a representer theorem |
154
click to vote
AMAI
2007
Springer
15 years 6 months ago
2007
Springer
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
151
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
161
click to vote
DLT
2009
15 years 3 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
145
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...