PUGET , J.-F. 1994. A C++ Implementation of CLP. In Proceedings of SPICIS'94 (Singapore, November 1994).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....all of which take the form of C object libraries. Each library defines several C constrained variable classes and the methods to model and solve them. Each component is seamlessly integrated with the others to facilitate easy collaboration between different components. ILOG Solver [Puget,94] is the core component of the Optimization Suite. It implements the basic engines for constraint programming. The add on components are built on Solver. They incorporate additional constraints, constraint variables, and solving algorithms for specific types of problems. The add ons are: ILOG ....

Puget, J.F.: A C++ implementation of CLP, Proceedings of the Second Singapore International Conference on Intelligent Systems, Singapore, 1994.

.... measures, like adding strict typing and moding (G odel [6] Mercury [9] integrating logic and functional styles (Curry [5] Mercury) or dismissing most of the Prolog heritage, keeping essentially logical variables in a host language that concentrates on other main aspects (Oz [10] Ilog solver [8]) The enhancements presented in this paper are not about such fundamental modi cations. They keep the underlying concepts unchanged, while at the same time making Prolog programming more e ective and maintainable, by allowing shorter programs and reducing the likelihood of errors more ....

J.-F. Puget. A C++ implementation of CLP. In Proceedings of SPICIS 94, Singapore, November 1994.

....tree search as well as neighborhoodbased search (local search) SALSA requires a host language that supports search (for example, Claire) as compilation target. ALMA O [4] extends Modula 2 by constructs for the creation of choice points which are resolved by backtracking based search. ILOG Solver [113, 114, 103, 57] is a constraint programming library that uses C as its host language. Solver provides finite domain constraints, finite set constraints, and constraints over real numbers. OPL [145, 147] is a constraint modeling language that uses Solver as its underlying execution platform. All systems ....

.... is: what if the language does not provide concurrency and implicit synchronization How can the programming capabilities provided by spaces be transferred to a library in a programming language neutral way The library approach to constraint programming has been proven successful by ILOG Solver [113]. Further attempts in this direction are Figaro [55] and CHOCO [74] Dependency Recording The search strategies considered in this thesis do not record and utilize information why a particular node in the search tree failed. So called lookback schemes [29, 68] analyze information found in the ....

Jean-Francois Puget. A C implementation of CLP. In Proceedings of the Second Singapore International Conference on Intelligent Systems (SPICIS), pages B256--B261, Singapore, November 1994.

....of the negation of involved constraints. An application to the devising of a declarative modeller for expressing camera motion using a cinematic language is sketched, and results from a prototype are presented. 1 Introduction Interval constraint based solvers such as clp(BNR) 8] ILOG Solver [18], and Numerica [24] have been shown to be e#cient tools for solving some challenging non linear constraint systems in various application areas (e.g. robotics, chemistry [16] or electronics [19] Relying on interval arithmetic [17] these tools guarantee completeness (all solutions in the input ....

J.-F. Puget. A C ++ implementation of CLP. In Proc. of SPICIS'94, 1994.

....computations [15] round o# errors, cancellations) constraints involving real valued variables are particularly di#cult to reliably solve. Originating from the pioneering work of Cleary [12] many constraint programming languages such as BNR Prolog [27] clp(BNR) 9] Prolog IV [10] ILOG Solver [28], and Numerica [33] address this problem by replacing floatingpoint arithmetic with interval arithmetic [3, 24] which guarantees the correctness of computations. The above mentioned solvers handle constraint systems by combining local consistency techniques and filtering [35, 23, 21] a domain ....

Jean-Francois Puget. A C ++ implementation of CLP. In Proceedings of the Singapore Conference on Intelligent Systems (SPICIS'94), Singapore, 1994.

....on a prototype are discussed. Tools and Techniques User interfaces; H.5. 1 [Information Interfaces and Presentation] Multimedia Information Systems Animations General Terms: Algorithms, Theory, Reliability 1 Introduction Interval constraint based solvers such as clp(BNR) 10] ILOG Solver [31], or Numerica [42] have been shown to be efficient tools for solving some challenging non linear constraint systems in various application areas (e.g. robotics, chemistry [28] or electronics [32] Relying on interval arithmetic [29] these tools guarantee completeness (all solutions in the ....

Jean-Franois PUGET. A C implementation of CLP. In Proceedings of the Singapore Conference on Intelligent Systems (SPICIS'94), Singapore, ####.

....turned out that constraint programming was able to find a feasible solution very rapidly, albeit with manual intervention. The work was carried out at the University of Leeds. The progressive party problem was formulated as a Constraint Satisfaction Problem (CSP) and implemented in ILOG Solver [3], a constraint programming tool in the form of a C library. Solver has a large number of pre defined constraint classes and provides a default backtracking search method for solving CSPs. If necessary, new constraint classes and search algorithms can be defined, but these facilities were not ....

J.-F. Puget. A C++ Implementation of CLP. In Proceedings of SPICIS94 (Singapore International Conference on Intelligent Systems), 1994.

....in the integration of constraint processing into non logic programming languages has grown together with the acceptance of constraintbased methods in the software community. Thus some systems have been implemented to integrate constraints into object oriented programming languages such as C [12], Java [5, 16] or Oz Mozart [6] Beeing further developments of CLP all of these, however, have some drawbacks in object oriented and distributed programms as we will discuss throughout the paper. The success of constraint programming (CP) is a consequence of its declarativity. The holy grail of ....

....presented in Figure 1. We will describe these components throughout this paper. A formal introduction to the execution model of ACS can be found in [14] In contrast to very popular existing constraint solvers, ACS allows incremental constraint posting (the commercially very successful ILOG Solver [12] and the newly availible ILOG JSolver does not) and constraint retraction (CLP does not; e.g. SICStus [4] and ECL [17] These two features support the development of highly interactive applications. Constraint based methods can be integrated into professional softwaredevelopment processes ....

J.-F. Puget. A c++ implementation of clp. Technical report, ILOG, 1994. In Ilog Solver Collected papers.

....propagator negation(b,b ) rei ed constraints can be used to implement the trivial error con CHAPTER 3. FINITE DOMAIN CONSTRAINT PROGRAMMING 23 straints. For non trivial error constraints, error constraints can be programmed like the rei ed constraints. In programming systems like Ilog Solver [19] or Mozart [17] error propagators can be programmed using a programming interface. Transforming the Comparators We can now de ne the error vector EC as a vector of the form hEC 1 ; EC 2 ; ECn i where E C i describes the error at rank C i . With globally better comparators, E C i , ....

J.-F. Puget. A C++ implementation of CLP. In Proceedings of the Second Singapore International Conference on Intelligent Systems (SPICIS), pages B256{B261, Singapore, Nov. 1994.

....could also be integrated in the system. We want to use this interface to compare di erent solver wrt. performance and functional capabilities. 3. 2 Other Existing Systems The most popular object oriented constraint processing system is ILOG Solver [13] that has been developed from a CLP system [16]. This system is not incremental, such that it is not very well suited for the use in strongly interactive constraint based applications. Other components available from ILOG, such as ILOG Scheduler [12] for example, seem very domain speci c to us. In our opinion ILOG thus does not provide a ....

J.-F. Puget. A c++ implementation of clp. Technical report, ILOG, 1994. In Ilog Solver Collected papers.

....[4] The interest in the integration of constraint processing into non logic programming languages has grown together with the acceptance of CP in the software community and industry. Thus some systems have been implemented to integrate CP into object oriented programming languages such as C [11] or Java [5, 3] The most popular development of this approach is ILOG Solver (www.ilog.fr) which is cannot be considered a CLP system anymore. 1.1 Motivation The success of constraint programming results to a large extend from the ef ciency of the used algorithms. Restricting variable domains ....

J.-F. Puget. A c++ implementation of clp. Technical report, ILOG, 1994. In Ilog Solver Collected papers.

No context found.

PUGET , J.-F. 1994. A C++ Implementation of CLP. In Proceedings of SPICIS'94 (Singapore, November 1994).

No context found.

[Pug941 Puget,J.F.,A C++ Implementation of CLP, Proceedings of Singapore International Conference on Intelligent System,1994

No context found.

J.F. Puget, A C++ implementation of CLP, Technical Report 94-01, ILOG S.A., Gentilly, France, 1994.

No context found.

J.-F. Puget. A c++ implementation of clp. Technical report, ILOG, 1994. In Ilog Solver Collected papers.

No context found.

Puget, J.F.: A C++ Implementation of CLP. In: Proceedings of the Second Singapore International Conference on Intelligent Systems, Singapore (1994)

No context found.

J. F. Puget. A C++ Implementation of CLP. Technical Report 94-01, ILOG S.A., Gentilly, France, 1994.

No context found.

J. F. Puget. A C++ implementation of CLP. In Proceedings of the Second Singapore International Conference on Intelligent Systems, Singapore, 1994.

No context found.

J. Puget. A c++ implementation of clp. In Proceedings of the 2nd Singapore International Conference on Intelligent Systems, 1994.

No context found.

J.-F. Puget. A C++ Implementation of CLP. In Proc. of SPICIS'94, November 1994.

No context found.

Puget, J.F.: A C++ Implementation of CLP. In: Proceedings of the Second Singapore International Conference on Intelligent Systems, Singapore (1994)

No context found.

J.F. Puget. A C++ Implementation of CLP. In Proceedings of SPICIS, November 1994.

No context found.

Puget, J., A c++ implementation of clp, in: Proceedings of the 2nd Singapore International Conference on Intelligent Systems, 1994.

No context found.

J-F. Puget. C++ implementation of clp. In SPICIS94, 1994.

No context found.

J.-F. Puget. A C++ Implementation of CLP. In Proceedings of the Second Singapore International Conference on Intelligent Systems, Singapore, 1994. 14

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