48 search results - page 6 / 10 » Abstract Computability of Non-deterministic Programs over Va... |
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,...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
EUROPAR
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
ICTAC
2010
Springer
13 years 5 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
SAC
2004
ACM
14 years 28 days ago
2004
ACM
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...