ECRC. ECL i PS e 3.5: ECRC Common Logic Programming System. User's Guide, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Programming for Knowledge Representation - Yakhno, Petrov (1998) (Correct)
.... [12] Subdefinite (SD) Computations [13] interval Newton method [9] Tolerance Propagation [11] and tools, e.g. UniCalc [1] ILOGsolver [14] Numerica [10] Employing constraint solving techniques in Logic Programming has brought into existence CHIP, PROLOG III, CLP(BNR) ECL i PS e [6,5,2,7] which are classics of CLP [4] ECL i PS e is a convenient platform for creating extensions of logic programming. Currently ECL i PS e includes several libraries based on constraint propagation, e.g. Finite Domains (FD) library, finite set domains library Conjunto. We add to ECL i PS ....
.... [n 2] var(Changed) true ; n 3] assign(X,XD, n 4] schedule woken(XF) n 5] wake [n 6] Figure #: Encoding for a calculation function [eclipse 9] set accuracy(10e 4) ln(X) cos(Y) 1, cos(X) ln(Y) 1. X = X 128 [1.1584290545099314, 1. 1584640986179457] Y = Y 251 [0.54922184875472391, 0.54923948277689594] Delayed goals: A 165 = 1 B 288 A 1243 = cos(X 128) B 1773 = A 1243 1 B 288 = cos(Y 251) A 165 = ln(X 128) B 1773 = ln(Y 251) A 1243 = 1 B 1773 yes. Figure #: Solution to OQ FRV [ # , FRV OQ [ # solvable within ....
[Article contains additional citation context not shown here]
ECRC. ECL i PS e 3.5: ECRC Common Logic Programming System. User's Guide, 1995.
Investigating Interative Inference Bound Deepening in Top Down .. - Scott Buffett (Correct)
....the first list again, in hopes of finding a better proof, but we did not want to backtrack any further, since this would cause the goal lists to be reversed. This does not allow for any cuts to control the backtracking, since there is nowhere to put them. To overcome this difficulty, an eclipse [e95] global variable, reverse goals flag, was used as a flag to indicate whether the first list had been solved or not. Initially, the reverse goals flag is set to yes , but if the first goal list is solved, the reverse goals flag is set to no . This instructs the procedure not to reverse the two ....
ECRC Common Logic Programming System 3.5 User Manual, 1995.
Using Stochastic Methods to Guide Search in CLP: a Preliminary.. - Lee Leung (1996) (1 citation) (Correct)
....tree. It is straight forward to generalize visit look to handle simple program annotations, by which programmers specify when to invoke the stochastic solver and when to rank child branches. 5 Experimental Results In this section we detail a number of preliminary experiments using the ECLiPSe [5] system augmented with a GENET stochastic solver [3] to illustrate the benefits that are possible. The two guiding principles for using a stochastic solver to control search have already been shown to be beneficial. The visit fail procedure is equivalent to an approach of Stuckey and Tam ....
ECRC Common Logic Programming System (ECLiPSe) version 3.5 User Manual.
Using Stochastic Methods to Guide Search in CLP: a Preliminary.. - Lee Leung (1996) (1 citation) (Correct)
....tree. It is straight forward to generalize visit look to handle simple program annotations, by which programmers specify when to invoke the stochastic solver and when to rank child branches. 5 Experimental Results In this section we detail a number of preliminary experiments using the ECLiPSe [3] system augmented with a GENET stochastic solver [1] to illustrate the benefits that are possible. The two guiding principles for using a stochastic solver to control search have already been shown to be beneficial. The visit fail procedure is equivalent to an approach of Stuckey and Tam described ....
ECRC Common Logic Programming System (ECLiPSe) version 3.5 User Manual.
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