Abstract (EN):
In the recent past much attention has been given to the handling of constraints. The focus of this paper is solving linear constraints on the natural numbers, a problem that is also of great importance in AC-unification. We describe a new algorithm that is faster than the methods we compared it with, and that may well contradict the view that this kind of algorithms is too expensive to be of practical use, for instance in the implementation of Constraint Logic Programming languages. © Springer-Verlag Berlin Heidelberg 1991.
Language:
English
Type (Professor's evaluation):
Scientific
No. of pages:
15