154 search results - page 1 / 31 » PAC-Learnability of Determinate Logic Programs |
ENTCS
2007
13 years 5 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
PODS
1990
ACM
13 years 9 months ago
1990
ACM
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
COLT
1992
Springer
13 years 9 months ago
1992
Springer
ICSE
2010
IEEE-ACM
13 years 7 months ago
2010
IEEE-ACM
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...