Sciweavers

3535 search results - page 116 / 707
» Logic Program Specialisation
Sort
View
140
Voted
LOPSTR
2004
Springer
15 years 9 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
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...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
155
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 29 days 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
140
Voted
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 8 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
131
Voted
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
15 years 9 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
126
Voted
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
15 years 7 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
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...
Lindsey L. Spratt, Allen L. Ambler