3119 search results - page 367 / 624 » General Default Logic |
188
click to vote
DIAGRAMS
2010
Springer
15 years 7 months ago
2010
Springer
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
163
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
199
click to vote
FSKD
2008
Springer
15 years 7 months ago
2008
Springer
Support Vector Machine (SVM) has been widely studied and shown success in many application fields. However, the performance of SVM drops significantly when it is applied to the pr...
144
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
177
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...