2272 search results - page 83 / 455 » A Calculus for |
145
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
116
click to vote
CADE
2003
Springer
16 years 4 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
122
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
121
Voted
ICASSP
2008
IEEE
15 years 10 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....
149
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...