T. Kawamura, H. Ohwada and F. Mizoguchi, CS-Prolog: A Generalized Unification Based Constraint Solver, 6th Conf on Logic Programming (Tokyo, Japan, June 1987), (K. Furukawa et al., Eds.), Springer LNCS 319, pp 19-39. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Theory and Practice of Constraint Handling Rules - Frühwirth (1998) (52 citations) (Correct)
....the solver is confluent, this means that from a given query, the answer will always be the same, regardless of which order we apply the rules. e.g. in the above query we could have started with applying transitivity to C= A,B= C. 3. RELATED WORK 3.1. Languages for Defining Constraints CS Prolog [KOM87] was presumably the first proposal to implement constraint solvers in a LP language itself utilizing a delay mechanism. Conditional rewrite rules were used to describe the behavior of the solver. However, it was years too early to be able to refine this idea and implement it efficiently. CHIP was ....
T. Kawamura, H. Ohwada and F. Mizoguchi, CS-Prolog: A Generalized Unification Based Constraint Solver, 6th Conf on Logic Programming (Tokyo, Japan, June 1987), (K. Furukawa et al., Eds.), Springer LNCS 319, pp 19-39.
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 Theory and.. - Thom Fruhwirth.. (Correct)
No context found.
T. Kawamura, H. Ohwada and F. Mizoguchi, CS-Prolog: A Generalized Unification Based Constraint Solver, 6th Conf on Logic Programming (Tokyo, Japan, June 1987), (K. Furukawa et al., Eds.), Springer LNCS 319, pp 19-39.
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