200 search results - page 27 / 40 » Symbolic Equivalences for Open Systems |
APAL
2007
13 years 7 months ago
2007
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper presents a new method to automatically add n-grams containing out-of-vocabulary (OOV) words to a baseline language model (LM), where these n-grams are sought to be gram...
DNA
2007
Springer
14 years 1 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
IJCAI
2007
13 years 9 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
OSDI
2008
ACM
14 years 8 months ago
2008
ACM
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...