Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Constraint Programming
A New Data Structure for Implementing Extensions to Prolog
PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
| Hi-index | 0.00 |
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 constraint resolution techniques. The theoretic part of the paper describes, in turn, subdefinite computations, their properties, and a method for integration of subdefinite computations into logic programming. The practical 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. Liapounov d'informatique et de mathÉmatiques appliquÉes.