3481 search results - page 158 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
147
click to vote
CORR
2010
Springer
15 years 17 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...
135
click to vote
SAS
2001
Springer
15 years 7 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...
124
click to vote
GECCO
2004
Springer
15 years 8 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...
124
click to vote
WCRE
2009
IEEE
15 years 10 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...
136
click to vote
ICLP
1999
Springer
15 years 7 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...