Sciweavers

19 search results - page 4 / 4
» Correctness of Multiplicative Proof Nets Is Linear
Sort
View
LPNMR
2001
Springer
13 years 10 months ago
Bounded LTL Model Checking with Stable Models
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...
Keijo Heljanko, Ilkka Niemelä
JELIA
1998
Springer
13 years 10 months ago
A Matrix Characterization for MELL
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic with exponentials. In the process we elaborate a methodology for proving mat...
Heiko Mantel, Christoph Kreitz
ICML
2008
IEEE
14 years 6 months ago
Learning all optimal policies with multiple criteria
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
Leon Barrett, Srini Narayanan
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
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...
Wolfgang Maass