4940 search results - page 183 / 988 » On the Complexity of Universal Programs |
153
click to vote
IJCAI
2007
15 years 6 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,...
153
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
187
click to vote
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
171
click to vote
EPS
1997
Springer
15 years 9 months ago
1997
Springer
In spirit of the earlier works done by Arthur (1992) and Palmer et al. (1993), this paper models speculators with genetic programming (GP) in a production economy (Muthian Economy)...
188
click to vote
EMSOFT
2011
Springer
14 years 4 months ago
2011
Springer
System specifications are often structured as collections of scenarios and use-cases that describe desired and forbidden sequences of events. A recently proposed behavioral progr...