40 search results - page 4 / 8 » Proof Nets, Garbage, and Computations |
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
LPNMR
2001
Springer
15 years 2 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
PPDP
2000
Springer
15 years 1 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...