2516 search results - page 15 / 504 » When is there a representer theorem |
177
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
177
Voted
JAR
2010
15 years 4 months ago
2010
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
191
click to vote
SIAMDM
2011
15 years 1 months ago
2011
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, o...
151
click to vote
FUIN
2006
15 years 6 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
180
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...