3470 search results - page 260 / 694 » Head-Elementary-Set-Free Logic Programs |
180
click to vote
SAS
2001
Springer
15 years 11 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...
171
click to vote
GECCO
2004
Springer
15 years 12 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...
181
click to vote
ILP
2005
Springer
16 years 1 days ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
177
click to vote
WCRE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
246
click to vote
MLG
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...