E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Value constraints in the CLP scheme - van Emden (1995) (1 citation) (Correct)
....in the choice of i at each stage. Lassez and Maher [LM84] studied such, what they called, chaotic iterations. We are interested in conditions under which chaotic iterations converge to K oe (fl) Such an iteration may be finite or not. The goal of the iteration is the same as that of what Davis [Dav87] calls the Waltz Algorithm. The contribution of Waltz is a technique for exploiting the freedom in selecting the i so as to expedite convergence. In this paper we will derive this technique for the more general situation considered here. 6.1 Fixpoint theory of chaotic iterations In the ....
E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987.
The Logic Programming Paradigm in Numerical Computation - van Emden (1999) (Correct)
....those for Perl and Java may be a sign that Gresham s law is relaxing its grip on computing. Thus there are three reasons for believing that interval methods are experiencing a reversal of misfortune. The advent of interval constraints is yet another one. Interval constraints Independently, Davis [9] and Cleary [7] arrived at a relational generalization of interval arithmetic, which is now known as interval constraints. Shortly after, Cleary s work was used in BNR Prolog [6, 5] to obtain software that can be viewed in two different ways. 1. BNR Prolog as a version of Prolog where soundness is ....
E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987.
Value constraints in the CLP scheme - van Emden (1996) (1 citation) (Correct)
....in the choice of i at each stage. Lassez and Maher [13] studied such, what they called, chaotic iterations. We are interested in conditions under which chaotic iterations converge to K oe (fl) Such an iteration may be finite or not. The goal of the iteration is the same as that of what Davis [6] calls the Waltz Algorithm. The contribution of Waltz is a technique for exploiting the freedom in selecting the i so as to expedite convergence. In this paper we will derive this technique for the more general situation considered here. 6.1 Fixpoint theory of chaotic iterations In the ....
E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987.
A Unified Framework for Interval Constraints and Interval.. - Hickey, van Emden, Wu (1998) (4 citations) (Correct)
....constraints Interval constraints can be traced to the dissertation by Waltz where constraints were propagated to reduce sets of possible values [19] The CHIP programming language [8] showed that this idea is more widely applicable. The next development was its application to reals by Davis [7]. BNR Prolog [5] can be regarded as an implementation of Davis s ideas with Prolog as front end programming language. That is, BNR Prolog is to Davis what CHIP is to Waltz. In actual fact, BNR Prolog was inspired by Cleary s relational interval arithmetic [6] which, however, viewed intervals as ....
E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987.
Declarative Numerical Analysis: an Interval Constraint-based.. - Hickey (1999) (Correct)
No context found.
E. Davis. Constraint propagation with labels. Artificial Intelligence, 32:281--331, 1987.
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