DMCA
Heterogeneous Constraint Solving (1996)
| Venue: | PROCEEDINGS OF ALP'96, VOLUME 1139 OF LNCS |
| Citations: | 50 - 10 self |
BibTeX
@INPROCEEDINGS{Benhamou96heterogeneousconstraint,
author = {Frédéric Benhamou},
title = {Heterogeneous Constraint Solving},
booktitle = {PROCEEDINGS OF ALP'96, VOLUME 1139 OF LNCS},
year = {1996},
pages = {62--76},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Most CLP languages designed in the past few years feature at least some combination of constraint solving capabilities. These combinations can take multiple forms since they achieve either the mixing of di erent domains or the use of di erent algorithms over the same domain. These solvers are also very di erent in nature. Some of them perform complete constraint solving while others are based on propagation methods. This paper is an attempt to design a uni ed framework describing the cooperation of constraint solving methods. Most techniques used in constraint-based systems are shown to be implementations of operators called constraint narrowing operators. A generalized notion of arc-consistency, called weak arc-consistency is proposed and is used to model heterogeneous constraint solving. We provide conditions on the constraint solving algorithms which guarantee termination, correctness and con uence of the resulting combined solver. This framework is shown to be general enough to describe the operational semantics of the basic constraint solving mechanisms in a number of current CLP systems. 1
Keyphrases
heterogeneous constraint di erent algorithm di erent domain multiple form operational semantics di erent guarantee termination current clp system generalized notion uni ed framework past year complete constraint clp language con uence combined solver weak arc-consistency constraint narrowing operator basic constraint constraint-based system propagation method
