Results 1  10
of
252
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
, 2009
"... ..."
Polytool: Proving termination automatically based on polynomial interpretations
, 2006
"... In this system description, we present Polytool, a fully automated system for proving lefttermination of definite logic programs (LPs). The aim of Polytool ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
In this system description, we present Polytool, a fully automated system for proving lefttermination of definite logic programs (LPs). The aim of Polytool
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
of equations in the dual space. While the SVM classifier has a large margin interpretation, the LSSVM formulation is related in this paper to a ridge regression approach for classification with binary targets and to Fisher's linear discriminant analysis in the feature space. Multiclass categorization
Abstract interpretation and application to logic programs
, 1992
"... Abstract interpretation is a theory of semantics approximation which is usedfor the construction of semanticsbasedprogram analysis algorithms (sometimes called“data flow analysis”), the comparison of formal semantics (e.g., construction of a denotational semantics from an operational one), the des ..."
Abstract

Cited by 317 (14 self)
 Add to MetaCart
collection, useless occurcheck elimination), program transformation (e.g., partial evaluation, parallelization), andeven program correctness proofs (e.g., termination proof). After a few simple introductory examples, we recall the classical framework for abstract interpretation of programs. Starting from a
Tabled Evaluation with Delaying for General Logic Programs
, 1996
"... SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stackbased memory management, SLDNF is often not appropriate for query evalu ..."
Abstract

Cited by 304 (29 self)
 Add to MetaCart
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stackbased memory management, SLDNF is often not appropriate for query
Polynomial interpretations as a basis for termination analysis of logic programs
 PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP’05), VOLUME 3668 OF LNCS
, 2005
"... ..."
A Semantic Basis for the Termination Analysis of Logic Programs
 Journal of Logic Programming
, 1999
"... This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings  a possibly infinite set of binary clauses. Termination of a program P and goal G is determined by the abs ..."
Abstract

Cited by 106 (12 self)
 Add to MetaCart
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings  a possibly infinite set of binary clauses. Termination of a program P and goal G is determined
1987], `Termination of rewriting systems by polynomial interpretations and its implementation', Science of Computer Programming
"... Abstract. This paper describes the actual implementation in the rewrite rule laboratory REVE of an elementary procedure that checks inequalities between polynomials and is used for proving termination of rewriting systems, especially in the more difficult case of associativecommutative rewriting sy ..."
Abstract

Cited by 86 (0 self)
 Add to MetaCart
systems, for which a complete characterization is given. 1. The origin of the problem Termination is central in programming and in particular in termrewriting systems, the latter being both a theoretical and a practical basis for functional and logic languages. Indeed the problem is not only a key
Termination Analysis of Logic Programs based on . . .
, 2007
"... This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were developed for term rewriting) to the logic programming domain. The main idea of the approach is that termination conditions ..."
Abstract
 Add to MetaCart
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were developed for term rewriting) to the logic programming domain. The main idea of the approach is that termination
TALP: A Tool for the Termination Analysis of Logic Programs
 In Proc. 11th RTA, LNCS 1833
, 2000
"... Introduction In the last decade, the automatic termination analysis of logic programs has been receiving increasing attention. Among other methods, techniques have been proposed that transform a wellmoded logic program into a term rewriting system (TRS) so that termination of the TRS implies termi ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Introduction In the last decade, the automatic termination analysis of logic programs has been receiving increasing attention. Among other methods, techniques have been proposed that transform a wellmoded logic program into a term rewriting system (TRS) so that termination of the TRS implies
Results 1  10
of
252