233 search results - page 16 / 47 » Applications of Polytypism in Theorem Proving |
147
click to vote
IPL
2006
15 years 6 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
147
click to vote
JMLR
2010
15 years 22 days ago
2010
In this paper, we study the problem of learning a matrix W from a set of linear measurements. Our formulation consists in solving an optimization problem which involves regulariza...
157
click to vote
SIGSOFT
2010
ACM
15 years 20 days ago
2010
ACM
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
126
click to vote
STACS
2009
Springer
16 years 22 days ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
213
click to vote
ERSHOV
2009
Springer
15 years 9 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...