1204 search results - page 65 / 241 » Termination of Polynomial Programs |
98
Voted
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
86
Voted
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
99
Voted
NIPS
2003
15 years 2 months ago
2003
We consider the policy search approach to reinforcement learning. We show that if a “baseline distribution” is given (indicating roughly how often we expect a good policy to v...
121
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
115
click to vote
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...