424 search results - page 50 / 85 » A Lambda Calculus with Forms |
CADE
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
WOLLIC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
KR
2004
Springer
14 years 2 months ago
2004
Springer
The Fluent Calculus has largely been focused on building agents that work individually. However, agents often need to interact with each other to learn more about their environmen...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
The desirable asymptotic optimality properties of the maximum likelihood (ML) estimator make it an attractive solution for performing independent component analysis (ICA) as well....