1943 search results - page 57 / 389 » Ordering Default Theories |
107
click to vote
ACL
2003
15 years 1 months ago
2003
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
112
click to vote
IJCAI
2001
15 years 1 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
105
click to vote
CADE
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
100
click to vote
APLAS
2010
ACM
15 years 1 days ago
2010
ACM
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially...
SIAMJO
2008
14 years 11 months ago
2008
Second-order sufficient optimality conditions are established for the optimal control of semilinear elliptic and parabolic equations with pointwise constraints on the control and t...