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 …

A rule-based language is proposed for product configuration applications. It is equipped with
a declarative semantics providing formal definitions for main concepts in product …

Many static analyses for declarative programming/database languages use Boolean
functions to express dependencies among variables or argument positions. Examples …

Computing xpoints and post xpoints of transformations has numerous applications in
computer science. In this paper, we present a universal top-down xpoint algorithm based on …

This article presents and illustrates a practical approach to the dataflow analysis of
constraint logic programming languages using abstract interpretation. It is first argued that …

Abstract interpretation is a systematic methodology to design static program analysis which
has been studied extensively in the logic programming community, because of the potential …

This paper presents an approach for universal left-termination of constraint logic programs,
based on approximations. An approximation is basically an algebraic morphism between …

We present a generic preprocessor for combined static/dynamic validation and debugging of
constraint logic programs. Passing programs through the preprocessor prior to execution …

Static value analysis is a classical approach for verifying programs with floating-point
computations. Value analysis mainly relies on abstract interpretation and over-approximates …

The Constraint Logic Programming (CLP) Scheme merges logic programming with
constraint solving over predefined domains. In this article, we study proof methods for …