Philippe Codognet and Daniel Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, 27(3):185--226, June 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....1 Introduction and Motivation Constraint Logic Programming (CLP) systems [JAF94] have been applied to many different domains each with distinct algebraic structures. The type of the domain gives place to different instances of the CLP scheme such as CLP(FD) CLP on finite ranges of integers) COD96a] CLP( CLP on real domain) REF96] CLP(Sets) CLP on finite sets of elements) GER97] or CLP(Bool) CLP on boolean domain) COD96b] However, problems suitable for solving with constraints often have a natural formulation which use more than one domain or a domain other than the built in ....

....have the control fixed by the system. These black box constraints provide very efficient tools for common constraint applications but lack adaptability when used for non standard prob5 lems. To overcome this lack of flexibility, some constraint systems now provide glass box constraints [FR U94, COD96a] These allow new constraints to be defined by the user, although, in most cases, these are still restricted to particular predefined domains such as the integers. However there are two practical problems with the current approach. The constraint solving process is usually hard wired using a ....

[Article contains additional citation context not shown here]

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD). In The Journal of Logic Programming, 27:185-226, 1996.

....While recomputation computes everything from scratch, trailing records for each state changing operation the information necessary to undo its effect. Most current constraint programming systems are trailing based. Many of them, for example CHIP [2] cc(FD) 13] Eclipse [3] and clp(FD) [5], are built on top of Prolog, which itself is trailing based. But also systems that are not built on top of Prolog, like Screamer [12] Lisp) and ILOG Solver [6] C ) use trailing. Copying offers advantages with respect to expressiveness: multiple nodes of a search tree are available ....

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). The Journal of Logic Programming, 27(3):185--226, June 1996.

....that D1 and D2 refer to integers and all other variables are finite domains. The = constraint is implemented by Oz s finite domain operator = and by = rected since data flow between propagators is bidirectional. This, for example, is different for a constraint solver using indexicals [3] because an indexical is a function rather than a relation. For instance, opi.oz:258 FD.reified.sumC opi.oz:259 FD.sumC opi.oz:260 the leftmost node corresponds to the propagator FD.sumC which happens to occur at line 260 of file opi.oz (the location of FD.sumC when we did the example graph ....

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). Journal of Logic Programming, 27(3):185--226, June 1996.

....systems. They successfully integrated constraints and constraint propagation into programming systems that come with built in search. Most of todays constraint programming systems are constraint logic programming (CLP) systems that evolved from Prolog: CHIP [33, 2] Eclipse [154] clp(FD) [25] and its successor GNU Prolog [31] and SICStus [17] just to name a few. The CLP approach to search is adopted by cc(FD) 148] Jaffar and Maher give an overview on CLP in [59] Search All these systems have in common that they offer a fixed and small set of search strategies. The strategies ....

....search and is superior for large examples. 14.1 Other Constraint Programming Systems Most of todays constraint programming systems are constraint logic programming systems (CLP) that evolved from Prolog and inherited Prolog s search capabilities: CHIP [33, 2] Eclipse [154] clp(FD) [25] and its successor GNU Prolog [31] and SICStus [17] just to name a few. Also cc(FD) 148] shares the approach to search taken by CLP based systems. Jaffar and Maher provide an overview on CLP in [59] Screamer [134] is based on Common Lisp and supports finite domain constraints and backtracking ....

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). The Journal of Logic Programming, 27(3):185--226, June 1996.

....search, visual search, and saturation. Saturation is an inference method for tautologychecking used in industrial practice. Computation spaces have shown their practicability in the constraint programming system Oz. 1 Introduction Existing constraint programming systems like CHIP [4] clp(FD) [2], ECLiPSe [1] and ILOG Solver [9] offer a fixed set of inference engines for search such as single, all, and best solution search. This is unfortunate, since new engines can only be implemented by the system s designer at a low level and cannot be integrated by the user. The paper presents ....

....search. A solution to this problem is recomputation, where spaces are recomputed on demand rather than being cloned in advance. fun Recompute S Is case Is of nil then Clone S [ I Ir then C= Recompute S Ir Commit C I C 1 2 1 2 1 2 1 2 1 2 1 2 A B C R A= Recompute R [2 1 1] B= Recompute R [2 1] C= Recompute R [2 1 2] Fig. 6. Recomputing spaces. The procedure Recompute (see Figure 6) recomputes a space from a space S higher up in the search tree and a list of integers Is describing the path between the two spaces. The path is represented bottom up, since it ....

[Article contains additional citation context not shown here]

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). The Journal of Logic Programming, 27(3):185--226, June 1996.

....constraints are handled globally by box consistency, whereas others are decomposed into primitive constraints. Hull consistency is enforced on this last constraint type. The main objective is to benefit from the e#ectiveness of both methods. DecLIC has been implemented by extending clp(fd) [14], a well known CLP language over finite domains developped by Codognet and Diaz whose source code is widely available . clp(fd) extends the Warren Abstract Machine (WAM) 36] to compile into C code Prolog like programs describing problems over finite domains [13, 14] In DecLIC, the WAM ....

....implemented by extending clp(fd) 14] a well known CLP language over finite domains developped by Codognet and Diaz whose source code is widely available . clp(fd) extends the Warren Abstract Machine (WAM) 36] to compile into C code Prolog like programs describing problems over finite domains [13, 14]. In DecLIC, the WAM instruction set was modified and extended to take into account the processing of real constraints with hybrid solvers. Interval constraints providing a generic framework, the resulting system is a compiler interpreter with constraint solving capabilities over integers, ....

[Article contains additional citation context not shown here]

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(fd). Journal of Logic Programming, 27(3):185--226, 1996.

....work on next include: Better SQL code generation, possibly by delaying the execution of database query goals, which should allow for a closer to optimal construction of queries. At present, SQL back end queries are treated individually. Further integration of the CLP aspects of GNU Prolog [10, 8]. This could include the addition of suitable constraint domains, such as strings. Re implementation of some aspects both of the tools (namely the ISCO compiler) and the resulting applications to make use of the Contextual Logic Programming implementation which is becoming usable in GNU ....

Philippe Codognet and Daniel Diaz. Compiling Constraint in clp(FD). Journal of Logic Programming, 27(3), June 1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, 27(3), June 1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, 27(3):185--226, June 1996.

No context found.

Codognet,P. and Diaz,D., Compiling Constraints in CLP(FD), Journal of Logic Programming,27(3), 185-226, 1996.

No context found.

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD).InThe Journal of Logic Programming, 27:1-199 ,1996.

No context found.

Codognet P. and Diaz D., Compiling constraints in clp(FD). In The Journal of Logic Programming, 27:185-226, 1996.

No context found.

Codognet P. and Diaz D., Compiling Constraints in clp(FD). In The Journal of Logic Programming, 27, pp:185-226, 1996.

No context found.

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD). In The Journal of Logic Programming, 27:185-226, 1996.

No context found.

Codognet, P. & Diaz, D. (1996a). Compiling constraints in clp(FD). The Journal of Logic Programming 27: 185--226.

No context found.

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD). In The journal of Logic Programming,27:1-199,1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(fd). Journal of Logic Programming, 1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, 1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). Journal of Logic Programming, 27(3):185--226, 1996.

No context found.

Codognet, P., and Diaz, D. Compiling constraints in clp(FD). Journal of Logic Programming 27, 3 (1996), 185--226.

No context found.

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD). In The journal of Logic Programming,27:1-199,1996.

No context found.

CODOGNET P. and DIAZ D., Compiling Constraints in clp(FD). In The journal of Logic Programming,27:1-199,1996.

No context found.

Philippe Codognet and Daniel Diaz. Compiling constraints in clp(FD). The Journal of Logic Programming, 27(3):185-226, 1996.

No context found.

P. Codognet & D. Diaz, Compiling Constraints in clp(FD), J. Logic Programming 27(3): 185--226 (1996).

No context found.

P. Codognet & D. Diaz, Compiling Constraints in clp(FD), J. Logic Programming 27(3): 185--226 (1996).

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