8232 search results - page 161 / 1647 » Dynamic Logic Programming |
165
click to vote
LOPSTR
2004
Springer
15 years 11 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...
138
click to vote
WLP
1997
Springer
15 years 10 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...
168
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
159
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
155
click to vote
VL
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...