D Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite differentâ€¦ (More)

The Constraint Logic Programming (CLP) Scheme was introduced by Jaaar and Lassez. The scheme gave a formal framework, based on constraints , for the basic operational, logical and algebraic semanticsâ€¦ (More)

Complete axiomizations for the algebras of infinite trees and infinite trees are presented. The axiomizations are parameterized by the alphabet of function symbols for both the finite trees andâ€¦ (More)

Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, asâ€¦ (More)

Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and theâ€¦ (More)

Abstract. We propose new filtering algorithms for the S EQUENCE constraint and some extensions of the S EQUENCEconstraint based on network flows. We enforce domain consistency on the Sâ€¦ (More)

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the contextâ€¦ (More)

For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to theâ€¦ (More)