Borning, S. Maher, M., Martindale, A. & Wilson, M. Constraint hierarchies and logic programing, in Proceedings of the Sixth International Logic Programing Conference, pp 149-164, 1989.  Home/Search   Document Not in Database   Summary   Related Articles

....constraint has a set of methods that can be invoked to satisfy the constraint. For example, the constraint v 1 = v 2 v 3 has three methods: v 1 v 2 v 3 (i.e. calculates the value of v 1 from the values of v 2 and v 3 ) v 2 v 1 v 3 and v 3 v 2 v 1 . In [1], the problem of constraint satisfaction in equational constraints hierarchies is a triplet (V,D,C) defined by: A set of n variables: V = v 1 , v 2 , v n . Each variable v i ranges over a domain d i . The set of domains d i is noted by D: D = d 1 , d 2 , d n ....

....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 ....

[Article contains additional citation context not shown here]

Borning, S. Maher, M., Martindale, A. & Wilson, M. Constraint hierarchies and logic programing, in Proceedings of the Sixth International Logic Programing Conference, pp 149-164, 1989.

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