Bouzoubaa M., The Houria Constraint Solver, Fifth Scandinav ian Conference On Artificial Inteligence, in IOS press, Trondheim, Norway, May 29 - 31, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Houria II: A Solver For Hierarchical Constraint Systems.. - Bouzoubaa, Neveu, Hasle (1995) (1 citation) Self-citation (Bouzoubaa) (Correct)
....for an over constrained system and Solution Graph (b) for constraint hierarchy (weak, 0.8) strong, 0.9) weak, 0.8) strong, 0.9) required, v 2 = 2 v 3 = well they represent the intentions of users on real problems. The solvers for overconstrained systems described in QuickPlan, Houria [18, 19, 20] are based on global criteria. These solvers find a valuation which satisfies more constraints than the one produced by solvers based on local criteria for the same over constrained problems. However, existing incremental solvers for satisfying constraint hierarchies have the property that every ....
....and index is the weight of this constraint. label is considered as a level in the hierarchy. index is considered as a satisfaction index by level. This criterion will satisfy in priority sequence constraints associated with the highest label and the largest satisfaction index. Like the solvers in [11, 3, 7, 18, 19, 20], this solver plans a solution graph, and applies local propagation. The planning (for obtaining the best solution graph(s) and execution (for obtaining the valuation) time is acceptable. 2 Theory of equational Constraint Hierarchies Each equational constraint has a set of methods that can be ....
[Article contains additional citation context not shown here]
Bouzoubaa M., The Houria Constraint Solver, Fifth Scandinav ian Conference On Artificial Inteligence, in IOS press, Trondheim, Norway, May 29 - 31, 1995.
Houria II: A Solver For Hierarchical Constraint Systems.. - Bouzoubaa, Neveu, Hasle (1995) (1 citation) Self-citation (Bouzoubaa) (Correct)
....for an over constrained system and Solution Graph (b) for constraint hierarchy (weak, 0.8) strong, 0.9) weak, 0.8) strong, 0.9) required, v 2 = 2 v 3 = well they represent the intentions of users on real problems. The solvers for overconstrained systems described in QuickPlan, Houria [18, 19, 20] are based on global criteria. These solvers find a valuation which satisfies more constraints than the one produced by solvers based on local criteria for the same over constrained problems. However, existing incremental solvers for satisfying constraint hierarchies have the property that every ....
....and index is the weight of this constraint. label is considered as a level in the hierarchy. index is considered as a satisfaction index by level. This criterion will satisfy in priority sequence constraints associated with the highest label and the largest satisfaction index. Like the solvers in [11, 3, 7, 18, 19, 20], this solver plans a solution graph, and applies local propagation. The planning (for obtaining the best solution graph(s) and execution (for obtaining the valuation) time is acceptable. 2 Theory of equational Constraint Hierarchies Each equational constraint has a set of methods that can be ....
[Article contains additional citation context not shown here]
Bouzoubaa M., The Houria Constraint Solver in Proceedings of International Workshop on Constraint-Based Reasoning, Constraint-95, FLAIRS-95, pp 104-111, Apr. 26-1995.
Houria III: A Solver For Hierarchical Systems Of.. - Bouzoubaa, Neveu, Hasle Self-citation (Bouzoubaa) (Correct)
....local criteria, many valuations might not be possible to compare (i.e two different valuations satisfying two disjoint constraint sets are not comparable) and regarding the semantics of the hierarchy, the best valuation can not be obtained. The solvers for over constrained systems described in [9, 10] are based on global criteria. These solvers find a valuation which satisfies more constraints than the one produced by solvers based on local criteria for the same over constrained problems. However, existing incremental solvers for satisfying constraint hierarchy have the property that every ....
....property that every class of soft constraints Houria III: Planning of LWSBG 3 labeled by a strength contains constraints with the same weight. This paper surmounts this restriction by presenting a incremental solver based on global criteria. This solver is the extension of the one described in [10]. It handles different classes of soft constraints labeled with a strength where each class may contain weighted constraints. The global criterion used by this solver is based on the sum of weights of satisfied constraints. Like the solvers in [6, 7, 8, 9, 10] this solver plans a solution graph, ....
[Article contains additional citation context not shown here]
M. Bouzoubaa. The houria constraint solver. In Fifth Scandinav ian Conference On Artificial Inteligence. IOS press., May 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC