A meta constraint logic programming architecture

Abstract

This work presents a general meta CLP architecture which can be built by adding CLP solvers as meta levels reasoning on the constraints of the underlying object system. We propose two specializations on finite domains: the first concerns the possibility of embedding the capability of performing qualitative reasoning in a CLP framework, while the second concerns a multi-level architecture for obtaining different degrees of consistency by using weaker algorithms.