Sciweavers

3481 search results - page 158 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 7 months ago
XSB: Extending Prolog with Tabled Logic Programming
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...
Terrance Swift, David Scott Warren
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 2 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
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...
Frédéric Mesnard, Ulrich Neumerkel
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
15 years 3 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
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...
Ken Taniguchi, Takao Terano
WCRE
2009
IEEE
15 years 4 months ago
The Logical Modularity of Programs
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...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
ICLP
1999
Springer
15 years 2 months ago
Bounded Nondeterminism of Logic Programs
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...
Dino Pedreschi, Salvatore Ruggieri