5506 search results - page 139 / 1102 » Minimal Logic Programs |
138
click to vote
LOPSTR
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
109
Voted
WLP
1997
Springer
15 years 7 months ago
1997
Springer
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
152
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
126
click to vote
SNPD
2003
15 years 4 months ago
2003
This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and dead-locks and indeterminism are avoided. I...
127
click to vote
SIAMSC
2010
15 years 1 months ago
2010
A surface reconstruction technique based on minimization of the total variation of the gradient is introduced. Convergence of the method is established, and an interior-point algor...