154 search results - page 11 / 31 » PAC-Learnability of Determinate Logic Programs |
EPIA
2007
Springer
14 years 4 months ago
2007
Springer
As we face the real possibility of modelling agent systems capable of non-deterministic self-evolution, we are confronted with the problem of having several different possible futu...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
ICLP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
ENTCS
2008
13 years 10 months ago
2008
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
ESOP
2012
Springer
12 years 5 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...