Freeman-Benson, B.N. Multiple solutions from constraint hierarchies. Tech. Rep., 88-04-02, University of Washington., Apr. 1988. 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) (Correct)
....better. Sat is a boolean 4 predicate, its value is true when the valuation q satisfies every constraint in C 0 , otherwise its value is false) S 0 = q: Sat(q , C 0 ) and S = q: q S 0 h S 0 better C (h, q) Many alternative definitions for comparators are given in [1, 2, 4], better is irreflexive and transitive. However, better will not provide a total ordering, so, there may exist q and h in S such that better C (h, q) and better C (q, h) In [1, 6, 7, 4] several different comparators are defined. The error function e is used. This error function returns a ....
Freeman-Benson, B.N. Multiple solutions from constraint hierarchies. Tech. Rep., 88-04-02, University of Washington., Apr. 1988.
Houria III: A Solver For Hierarchical Systems Of.. - Bouzoubaa, Neveu, Hasle (Correct)
....comparator predicate better. Sat is a boolean predicate, its value is true when the valuation satisfies every constraint in C 0 , otherwise its value is false) S 0 = f : Sat( C 0 )g and S = f : 2 S 0 8j 2 S 0 :better C (j; g Many alternative definitions for comparators are given in [11, 12, 4], better is irreflexive and transitive. However, better will not provide a total ordering, so, there may exist and j in S such that :better C ( j) and :better C (j; In [11, 13, 8, 4] several different comparators are defined. The error function e(c ) is used. This error function returns ....
B. N. Freeman-Benson. Multiple solutions from constraints hierarchies. Tech. rep., University of Washington, April 1988.
Multi-way versus One-way Constraints in User.. - Sannella.. (1993) (56 citations) Self-citation (Freeman-benson) (Correct)
....(with multiple valid solutions) or overconstrained (with no valid solution) When a constraint network has multiple solutions, it may be difficult to predict and control which solution is chosen. One approach to this problem is to display the multiple solutions, and allow the user to select one [17]. Another approach is to use preferential constraints within a constraint hierarchy to specify declaratively a preference for one solution over another. Multiple solutions are not a problem with the simplest type of oneway constraint system, which allow at most one constraint to output to a given ....
Bjorn N. Freeman-Benson. Multiple Solutions from Constraint Hierarchies. Technical Report 88-04-02, Department of Computer Science and Engineering, University of Washington, Seattle, WA, April 1988.
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