13383 search results - page 133 / 2677 » Abstractions from proofs |
222
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
182
click to vote
CEAS
2005
Springer
15 years 8 months ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
182
click to vote
NIPS
2004
15 years 7 months ago
2004
Machine learning is often used to automatically solve human tasks. In this paper, we look for tasks where machine learning algorithms are not as good as humans with the hope of ga...
170
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
162
Voted
IS
2006
15 years 6 months ago
2006
The Semantic Web is being designed to enable automated reasoners to be used as core components in a wide variety of Web applications and services. In order for a client to accept ...