1137 search results - page 13 / 228 » Partial Program Admission |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
AAAI
2004
13 years 9 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
ESOP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
CBMS
2004
IEEE
13 years 11 months ago
2004
IEEE
The osteophyte shows only on some particular locations on the vertebra. This indicates that other locations on the vertebra shape contain that are not of interest hinder the spine...
PEPM
2007
ACM
14 years 1 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...