64 search results - page 4 / 13 » On the Proof Complexity of Deep Inference |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
JMLR
2010
13 years 23 days ago
2010
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
AIML
2004
13 years 7 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
RAS
2010
13 years 4 months ago
2010
This article investigates fundamental issues in scaling autonomous personal robots towards open-ended sets of everyday manipulation tasks which involve high complexity and vague j...
CAV
1998
Springer
13 years 10 months ago
1998
Springer
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...