Numeric constraint resolution in logic programming based on subdefinite models

Abstract

Subdefinite computations introduced in [12] are a method of representation and processing of partial specifications. With respect to Constraint Programming, subdefinite computations are a generic con- straint resolution techniques. The theoretic part of the paper describes, in turn, subdefinite computations, their properties, and a method for in- tegration of subdefinite computations into logic programming. The prac- tical part describes an implementation of subdefinite computations with subdefinite numbers in the logic programming system ECLiPSe (Interval Domain library), empirically compares the Interval Domain library to a state-of-art solver of non-linear constraints and describes an application of the Interval Domain library to a problem from financial mathematics. This research is supported by grant 98-06 from l'Institut d'A. M. Lia- pounov d'informatique et de mathfiematiques appliqufiees.