Joxan Jaffar, Spiro Michayov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992. 142  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of Tables 1 Ranges for Heart function . 56 2 Executing sequence in the problem of heart funcionality diagnose 59 iv 1 Introduction Constraint Logic Programming (CLP) systems support many different domains such as finite ranges of integers [10, 14] reals [29, 36, 38, 7], finite sets [39, 23] or the Booleans [15, 6] The type of the domain determines the nature of the constraints and the solvers used to solve them. In particular, the cardinalityofthe domain determines the constraint solving procedure so that existing CLP systems have distinct constraint solving ....

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(!) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, 1992.

....for the length of the tail X in the goal append( H jX ] djejf ] ajbjcjdjejf ] can be found by solving the corresponding abstract goal append(1 X; 3; 6) resulting in X = 2. A possible implementation can be obtained by slightly modifying the CLP (R) 226 R. GIACOBAZZI et al. interpreter in [47] to cope with affine relations. This corresponds to implement (at the meta level) the join operator for affine subspaces so as to combine the computed answer constraints generated by the interpreter. Thus, abstract interpretation for linear size relationships can be joined to a concrete ....

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339-- 395, 1992.

..... In some applications, may also be satisfaction complete with respect that is, for every c #L, either T = c. The number of instances of CLP(X ) has grown so much in the last years that it would be impractical to cite them all. Classical CLP(X ) systems, so to speak, are CLP(R) JMSY92] which computes over the constraint domain of linear arithmetic over the real numbers, CHIP [DVS 88] which also computes over the domain of Boolean values and functions, and Prolog III [Col87] which has a host of constraint domains. Prolog itself can be seen as CLP(FT ) where is the ....

Joxan Ja#ar, Spiro Michayov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

....extension to handle metric constraints. Other researchers have combined logical and constraint reasoning, usually in the context of programming languages. clpr may be thought of as an integration of Prolog and linear programming, and this work introduced the notion of incremental Simplex [ Ja#ar et al. 1992 ] Saraswat s thesis [ Saraswat, 1989 ] formulates a family of programming languages which operate through the incremental construction of a constraint framework. chip [ Van Hentenryck, 1989 ] augments logic programming with the tools to e#ciently solve constraint satisfaction problems (e.g. ....

Joxan Ja#ar, Spiro Michaylov, Peter Stuckey, and Roland Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

....conflict sets, learning, and backjumping. Other researchers have combined logical and constraint reasoning, usually in the context of programming languages. clpr may be thought of as an integration of Prolog and linear programming, and this work introduced the notion of incremental Simplex [ Ja#ar et al. 1992 ] Saraswat s thesis [ Saraswat, 1989 ] formulates a family of programming languages which operate through the incremental construction of a constraint framework. A variety of recent systems have addressed the issue of integrating metric reasoning into planning. ILPPLAN [ Kautz and Walser, 1999 ....

Joxan Ja#ar, Spiro Michaylov, Peter Stuckey, and Roland Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

....should be 1, or that two expressions should have the same type. Constraints have been used as a tool to solve many di#erent problems. In each application the domain of the constraints depends on the problem that are being solved. The domains used are as di#erent as the set of real numbers, R [9], an arbitrary finite domain [11, 6] finite terms [17] sets of strings [12] and regular terms [14] It is the latter domain we will look at here. The constraints used in [14] are ine#cient in the sense that there is no known polynomial time algorithm for finding a solution to the constraints ....

Joxan Ja#ar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

....constraint solver. 1 Introduction The constraint logic programming paradigm [13] generalizes logic programming by replacing the Herbrand universe of terms by other, in general more powerful, domains. Unification of terms is replaced by solving constraints over these domains. For instance, CLP(R) [15, 11] adds real numbers to the Herbrand universe and contains equations and inequations as constraints. The system includes a constraint solver over the real numbers. Since solving nonlinear constraints is a complex problem, the constraint solver in CLP(R) is restricted to linear constraints. Nonlinear ....

....is added. 1 In this simple example the groundness analysis can be improved by considering all constraints in an arbitrary order instead of a left to right order. However, this cannot be done in general if the constraints originate from the execution of several predicates. 2 Similarly to CLP(R) [15] we assume that a CLP(R) program is well typed. 3 In contrast to CLP(R) we do not consider other arithmetic functions like , sin, cos, pow, abs, min and max. These functions can be treated similarly to in our abstract interpretation algorithm. We will discuss this subject in Section 5. 3 ....

[Article contains additional citation context not shown here]

J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, Vol. 14, No. 3, pp. 339--395, 1992.

....More resources are needed if larger and more realistic problems are to be used in comparing and contrasting the CLP systems. It should be also noted that we have only compared the FD libraries. Similar comparative studies could also be made for other common domains such as Intervals [2] or Reals [16]. To summarise our results, for maximum efficiency the Ilog SOLVER is best. clp(FD) is also a good candidate provided the size of the problem (measured in number of FD variables) is fairly small. Finally, IF Prolog and SICStus both perform well although, in the tests here, SICStus had the greater ....

JAFFAR J., MICHAYLOV S., STUCKEY P. and YAP R., The CLP(!) language and system. ACM Transactions on Programming languages and Systems, 14(3):339-395, July, 1992.

....the constraint (logic programming) technology. In particular, CHIP [56] was the first CLP language to employ constraint propagation [84] Other examples of CLP related systems are the constraint handling libraries of ILOG [96] and COSYTEC [47] and the CLP languages Prolog III [44, 45] CLP(R) [98], ECLiPSe [95, 179] CIAO [91] and clp(fd) 38] With these systems, many hard application domains have been tackled successfully using constraint related technologies. Examples are circuit verification, scheduling, resource allocation, timetabling, control systems, graphical interfaces, and many ....

J. Jaffar and al. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 1992.

No context found.

J. Jaffar, S. Michaylov, P. Stuckey and R. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems 14 (3): 339--395, 1992.

No context found.

J. Jaffar, S. Michaylov, P. Stuckey and R. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems 14 (3): 339--395, 1992.

No context found.

J. Jaffar, S. Michaylov, P. Stuckey and R. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems 14 (3): 339--395, 1992.

No context found.

JAFFAR J. MICHAYLOV S. STUCKEY P.J. and YAP R.H.C., The CLP(R) Language and System, ACM transactions on Programming Languages and Systems, Vol.14, No.3, July 1992. Pages 339-395.

No context found.

J. Jaffar et al., The CLP(R) Language and System, ACM Transactions on Programming Languages and Systems, Vol.14:3, July 1992, pp 339-395.

No context found.

JAFFAR J. MICHAYLOV S. STUCKEY P.J. and YAP R.H.C., The CLP(R) Language and System, ACM transactions on Programming Languages and Systems, Vol.14, No.3, July 1992. Pages 339-395.

No context found.

Joxan Jaar, Spiro Michaylov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339-395, July 1992.

No context found.

Joxan Jaffar, Spiro Michayov, Peter Stuckey, and Roland Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992. 142

No context found.

J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP(R ) language and system. ACM Transactions on Programming Languages and Systems, 14 (3): 339--395, 1992.

No context found.

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(!) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, 1992.

No context found.

Jaffar, J., Michaylov, S., Stuckey, P. &Yap, R. (1992). The CLP(#) language and system. ACM Transactions on Programming Languages and Systems 14(3): 339--395.

No context found.

J. Jaffar, S. Michaylov, P.J. Stuckey, and R.H.C. Yap. The CLP(!) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

No context found.

J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP(R ) language and system. ACM Transactions on Programming Languages and Systems, 14 (3): 339--395, 1992.

No context found.

Joxan Ja#ar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339--395, July 1992.

No context found.

J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 1991. To appear.

No context found.

Jaffar, et al. The CLP(!) language and system. ACM transactions on programming languages and systems 14, 3 (July 1992), 339-395.

First 50 documents  Next 50

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