967 search results - page 76 / 194 » Probabilistic Predicative Programming |
120
Voted
LOPSTR
1994
Springer
15 years 6 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
152
Voted
PODS
1991
ACM
15 years 6 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
118
Voted
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
128
Voted
RTAS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
115
click to vote
ICLP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...