|
Author(s): M. Bouzoubaa
Abstract:
:The Houria constraint solver is an efficient incremental algorithm that uses
local propagation to maintain sets of required and preferential constraints.
Houria
represents constraints between variables by sets of short procedures (methods) and
incrementally resatisftes the set of constraints when individual constraints are added
and removed.
The criterion of comparison used in Houria is more powerful than that of
some other solvers.
Houria is used to construct a graph of methods by planning and exe-
cuting all these methods to found a best solution.
The solution found by Houria satisfies
more constraints than the one produced by some other solvers and that for the same
over-constrained problems while respecting the hierarchy.
1 Introduction
In [3,4], Borning et al.
proposed constraint hierarchies to cope with
problem of over-constrained systems.
A constraint hierarchy is a sys-
tem of constraints wi...
Pages: 8
Size: 916 kb
Paper DOI: 10.2495/AI950241
|
|
Download
the Full Article
Price: US$
0.00
This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon below.
Send
this page to a colleague.

|