J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, pages 196--219. University of Melbourne, MIT Press, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....with continuous domains and linear constraints, simplex based methods such as Linear Programming (LP) and Mixed Integer Programming (MIP) are used [Dantzig,63] In this case, the solving engine is often referred to as a linear solver. Several systems such as Prolog III [Colmerauer,87] CLP(R) JM,87] CHIP[DVSAGB,88] 2LP [MT,95] and the ILOG Optimization Suite (ILOG Planner) ILOG OPT,98] ILOG Plan,98] incorporate a linear solver. From the standpoint of constraint programming, the techniques of LP and MIP are special cases of the general CP framework. They provide the means to obtain ....

Jaffar, J.; Michaylov, S.: Methodology and Implementation of a CLP System, Proceedings of the 4th International Conference on Logic Programming, pages 196-218, Melbourne, Australia, 1987.

....strict ways if she is to use the systems advantageously. Furthermore the basic, built in, constraints which are the only ones provided by the current CLP systems are not guaranteed to be appropriate for anything else but a limited number of applications. Such systems include [Col90] DHS 88] JM87] and [JL87] the latter of which is a schema for CLP but for which the above mentioned restrictions still hold) Syntax Here we present the syntactic objects of the framework. We appeal to simplicity and intuition rather than to strict formal definitions. Following the initial formulation of ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In Fourth International Conference on Logic Programming (ICLP-91), Melbourne, Australia, May 1987.

....interpreted in an algebra providing rational trees and rational numbers and allows for linear equations and inequations for numbers, boolean expressions for truth values, and equations and disequations for general terms. Other recent examples of constraint logic programming languages are CLP(R) JM87] CIL [Muk87] and CHIP [DHS 88] Jaffar and Lassez [JL86, JL87] were the first to identify the new model, coined the name Constraint Logic Programming, and developed a general framework that is parameterized This Chapter is an adaptation of [HS88] 7 with respect to the constraint ....

J. Jaffar and S. Michaylov. Methodology and implementation of a clp system. In J.-L. Lassez, editor, Proceedings of the 4th International Conference on Logic Programming, Cambridge, Mass., 1987. MIT Press.

....of the clausal definitions of predicates. 1 Introduction A major difficulty with logic programming is combinatorial explosion: since goals are solved with possibly indeterminate (i.e. branching) reductions, the resulting search trees may grow wildly. Constraint logic programming systems [5, 12, 7] try to avoid combinatorial explosion by building in strong determinate (i.e. non branching) reduction in the form of constraint simplification. In this paper we present two concepts, residuation and guarded rules, for further strengthening determinate reduction. Both concepts apply to constraint ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez, editor, Proceedings of the 4th International Conference on Logic Programming, Cambridge, MA, 1987. The MIT Press.

....the delayed goals and the one of the finite domains. In this paper, we describe the problem and propose a solution to solve it. Examples are given with the ECL i PS e syntax. 1 2 Using Metaterms 2. 1 One Example In his thesis, Holzbaur [1] uses extended unification to implement constraints [3]. He gives a full specification of constraints over finite domains using metastructures. In this scheme he has metafunctors and a specific Prolog predicate to unify them. Holzbaur needs two metafunctors. The first one, called dom 2, is used to encode finite domains. The second one, called ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.L. Lassez, editor, 4th Int. Conf. Logic Programming. MIT Press, 1987.

....constantly confronted with new languages often through hyped propaganda. It is therefore important that software engineers know of the various language paradigms: functional programming (Lisp [80] Standard ML [56] Miranda [112] Haskell [111] logic (including constraint logic) programming [75, 68, 36], imperative programming [90, 57] parallel programming [63] and algebra programming [102] 10 D.Bjrner and J.R.Cu ellar: Software Engineering Education In the area of imperative programming Dijkstra s concept of non determinism, paired with his formulation of Hoare logic [60] in the concept of ....

.... Haskell [111] Roles of Formal Specification and Design Calculi July 22, 1998 11 Prolog is the quintessential example of a logic programming language [75] Additionally constraint logic programs can be processed by such systems as CLPR (Constraint Logic Programming [IBM Yorktown] Research) [68], Chips [36] etc. Basic logic programming centers around a first order propositional calculus, but teaching logic programming provides a good basis for teaching mathematical logic, say first order predicate calculus [46] 3.7.4 Parallel Process Programming Languages In parallel programming we ....

[Article contains additional citation context not shown here]

J.Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. Technical report, IBM Research, Yorktown, 1987.

....operation inside a web browser. The UCAV GUI was written using Tcl Tk and the daVinci graph visualization tool (Frohlich Werner 1997) MACBeth Planning MACBeth uses Hierarchical Task Network (HTN) planning (Erol, Hendler, Nau 1994b; Wilkins 1988) and constraint logic programming techniques (Jaffar Michaylov 1987; Hentenryck 1989) to generate mission plans that meet specifications provided by a human user. MACBeth analyzes the user s specifications for feasibility, and automatically generates mission plans consistent with the user s requirements and restrictions. MACBeth will also prefer optimal plans ....

Jaffar, J., and Michaylov, S. 1987. Methodology and implementation of a CLP system. In Proceedings of the Fourth International Conference on Logic Programming. (Cambridge, MA: MIT Press).

....solving algorithm used is a modification of the first phase of the two phase Simplex algorithm [MSBS90, Leu84] In the rest of this thesis familiarity with the standard Simplex method is assumed. Work for the design, algorithms used and implementation methodology of CLP(R) is reported in [JM87] and [PJSY92a] PJSY92b] defines a very efficient abstract machine, the Constraint Logic Abstract Machine (CLAM) for the compilation of CLP(R) programs. JMSY92] explains the algorithms needed to provide the user with answer constraints resulting from the processed tableau of constraints and ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In Lassez [Las87], pages 196--218.

....6] provides a natural and general way to combine deduction and constraint solving, for the goal of reasoning with or solving non trivial problems in a declarative way. During last years, several important CLP systems have been developed such as (only to mention a few) Prolog III [6, 7] CLP(R) [13, 9], CHIP [8] CAL [1] CLP(BNR) 16, 2] RISC CLP [10, 11] See also [4] for an extension) The computation domain provided by these systems are trees, finite sets (domains) booleans, real numbers, and various combinations. In this paper, we describe a new CLP system for the domain of complex ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez, editor, Proceedings 4 th ICLP, pages 196--218, Cambridge, MA, May 1987. The MIT Press.

....independence notion is proved to hold for the goals involved in the optimization. In order to exemplify the applicability of the previously defined notions we will review a few examples of solvers with respect to their solver independence characteristics. In many CLP systems, for example CLP( [11] and Prolog III [2] constraint testing over systems of linear equations and inequations is performed using an incremental version of the Simplex algorithm. Essentially this involves incrementally recomputing a normal form for the constraint solver when a new constraint is added. This is done by a ....

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, pages 196--219. University of Melbourne, MIT Press, 1987.

....and binary relations In the frame of the ACCLAIM project sponsored by European Community ESPRIT BRA 7195 Austrian Science Foundation P9374 PHY. such as f6= g together with unary relations that declare the domain to which a variable belongs. Jaffar and his group s CLP(R) [9, 14] computes on the domain of trees over reals and supports decision of linear constraints among arithmetical terms [15, 19] An analysis of the main differences among CLP(R) and RISC CLP is presented in [12] Sakai and Aiba s CAL (Contrainte avec Logique) 22] offers nonlinear constraints over the ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez, editor, Proceedings 4 th ICLP, pages 196--218, Cambridge, MA, May 1987. The MIT Press.

....8 Related Work Previous work in this area falls into two main areas: constraints and logic programming, and using constraints in applications. The Constraint Logic Programming scheme is described in [6] A number of CLP languages have been implemented, including including Prolog III [3] CLP(R) [5, 7] and CHIP [4] There has also been considerable work on using constraints in applications such as geometric layout, physical simulations, and user interface design, document formatting, algorithm animation, and design and analysis of mechanical devices and electrical circuits. Constraint ....

Joxan Jaffar and Spiro Michaylov. Methodology and Implementation of a CLP System. In Proceedings of the Fourth International Conference on Logic Programming, pages 196--218, Melbourne, May 1987.

....towards simple types with type variables [31] which is in fact the domain of Prolog. Miller studies the correspondence between logical quantifications (8 and 9) and quantification [26] One can see the extension of Prolog with simply typed terms merely as the instance CLP( of the CLP scheme [22]. Other possible domains in Prolog flavour are the typed calculi of Barendregt s cube [2, 18] Elliot and Pfenning have studied unification in some of these calculi [13, 34] We describe the computation domain of Prolog, the various notions of variables and substitutions in this domain, and the ....

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.L. Lassez, editor, 4th Int. Conf. Logic Programming, MIT Press, 1987.

.... constraints and providing a constraint solver for the constraints) For instance, CHIP contains constraint systems over finite domains [30] Booleans [3] and rational numbers [14, 35] Prolog III [9] is endowed with constraint 1 systems over Booleans, rational numbers, and lists, while CLP( [17] solves constraints over real numbers. The CLP scheme was further generalized into the cc framework of concurrent constraint programming [27, 28, 29] to accommodate additional constraint operations (e.g. constraint entailment [21] and new ways of combining them (e.g. implication or blocking ask ....

....of cc(FD) about 40,000 lines of C) are the inclusion of optimal consistency algorithms based on AC 5 [34] dynamic specializations of data structures 1 In the following, we use the term CLP languages generically to denote both CLP and cc languages. 2 sizeMaster(112) sizeSquares([50,42,37,35,33,29,27,25,24,19,18,17,16,15,11,9,8,7,6,4,2]) Figure 1: The Data for the Perfect Square Problem and constraints, and incremental algorithms for the combinators. The contributions of this paper are as follows: 1. it presents cc(FD) a simple, uniform, and clean declarative nondeterministic constraint logic language over finite domains; ....

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, Melbourne, Australia, May 1987.

.... to a complete set of unifiers of the system A = H , we can compute Can ( C C ) and if D, s is one of the solutions produced by Can, the following resolvent can be adopted : D (R R ) s This definition of extended resolution step is very similar to the one adopted in CLP(X) [21,22]. 3 Log Implementation This section of the paper will present an overview of the implementation of Log , focusing on some general aspects (term representation, etc. A more detailed description of the implementation of the unification algorithm and the constraint analyzer is presented in the ....

Jaffar J., Michaylov S. (1987) - "Methodology and Implementation of a CLP System" - Proceedings of the 4th International Conference on Logic Programming, MIT Press.

....the symbols in the language. The two alternative mechanisms used in the currently implemented CLP systems to achieve this operation are: 1) fix the interpretation before the program executes or (2) fix the interpretation at a point during program execution when it is used in a constraint. CLP(R) [5] and Prolog III [1] take the first approach whereas CHIP [2] takes the second approach. The problem with the first approach is that interpreted terms cannot be manipulated syntactically. The problem with the second approach is that all constraint operations have to be made explicit and this ....

Joxan Jaffar and Spiro Michaylov, "Methodology and Implementation of a CLP System", Proceedings of the 4 th International Conference on Logic Programming, Melbourne, 1987, pp. 196--218.

.... constraints and providing a constraint solver for the constraints) For instance, CHIP contains constraint systems over finite domains [23] Booleans [2] and rational numbers [11, 26] Prolog III [6] is endowed with constraint systems over Booleans, rational numbers, and lists, while CLP( [13] solves constraints over real numbers. The CLP scheme was further generalized into the cc framework of concurrent constraint programming [19, 20, 21] to accommodate additional constraint operations (e.g. constraint entailment [17] and new ways of combining them (e.g. implication or blocking ask ....

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, Melbourne, Australia, May 1987.

....unification (which can be viewed as testing the satisfiability of equations over the Herbrand universe) constraints are accumulated and tested for satisfiability over D, using techniques appropriate to the domain. Several such languages have now been implemented, including Prolog III [5] CLP(R) [14, 17] and CHIP [7] The formal semantics of such languages differ mainly in the choice of underlying domain and constraints, as was shown formally in [16] It was also shown that for every language that can be obtained from the CLP scheme for solution compact domains D, numerous desirable properties of ....

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Proceedings of the 4th International Conference on Logic Programming, 1987.

....The optimizations are described in Sections 3 to 6. Section 7 contains the test results and describes the optimized code, and Section 8 concludes. 2 Introduction to CLP(R) In this section we sketch the language CLP(R) its operational semantics, and its implementation. The reader is referred to [7, 8, 9] for more details. A CLP program consists of a number of clauses of the form H : B : where H is an atom, is a (possibly empty) conjunction of constraints, and B is a (possibly empty) sequence of atoms. The clause is read as A is true if the constraints hold and B is true . CLP(R) extends ....

....P = 100000 Q 3 : R 0 P = 0:0278 B 97:22 R Q 4 : T = 355 B = 385:449: The query Q 1 could be processed correctly by a Prolog system, while the others require the extra power of CLP(R) In particular the answer to Q 3 shows the ability to produce symbolic output . The CLP(R) interpreter [8, 9] is implemented as an engine, interface, and constraint solver. The engine performs traditional Prolog like operations such as clause search and backtracking. The interface classifies and solves trivial constraints, while the constraint solver handles arithmetic constraints. Constraints are sent ....

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. Proc. of the 4th International Conference on Logic Programming, 196--218, 1987.

....of uninterpreted functors over real arithmetic terms. A working knowledge of PROLOG programming is assumed in this document; the book by Sterling and Shapiro [13] can serve as a suitable introductory text. Further technical information on CLP(R) is available on language design and implementation [6, 7], meta programming [3] and delay mechanisms [8] Additionally, much has been written about applications in electrical engineering [2] differential equations [1] options trading [10] music theory [15] molecular biology [16] etc. This document is both an introductory tutorial and reference ....

.... 9, S = 1, M = 1, C1 = 0, C2 = 0, C3 = 0, C4 = 0, C1 = 1, C2 = 1, C3 = 1, C4 = 1, M = C1, C2 S M = O C1 10, C3 E O = N 10 C2, C4 N R = E 10 C3, D E = Y 10 C4, bit(C1) bit(C2) bit(C3) bit(C4) bit(0) bit(1) gendiffdigits(L) gendiffdigits(L, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) gendiffdigits( gendiffdigits( H T] L) select(H, L, L2) gendiffdigits(T, L2) select(H, H T] T) select(H, H2 T] H2 T2] select(H, T, T2) solve(S, E, N, D, M, O, R, Y) Critical Path Analysis This program uses local propagation to compute start, ....

J. Jaffar and S. Michaylov, "Methodology and Implementation of a CLP System", Proceedings 4 th ICLP, MIT Press, May 1987, 196--218.

No context found.

J. Jaffar and S. Michaylov. Methodology and Implementation of a CLP System. In Fourth International Conference on Logic Programming, pages 196--219. University of Melbourne, MIT Press, 1987.

No context found.

Joxan Jaffar and Spiro Michaylov, `Methodology and implementation of a CLP system', Proc. Fourth International Conference on Logic Programming, Melbourne, May 1987, pp. 196--218.

No context found.

Joxan Jaffar and Spiro Michaylov. Methodology and implementation of a clp system. In JeanLouis Lassez, editor, Logic Programming: Proceedings of the Fourth International Conference, pages 196--218, Cambridge, MA, May 1987. M. I. T. Press. 48

No context found.

J. Jaffar, S. Michaylov, Methodology and Implementation of a CLP System, in J.L. Lassez (ed.), Logic Programming - Proceedings of the 4th International Conference - Volume 1, MIT Press, Cambridge, MA, 1987.

No context found.

J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In 4th IEEE Symposium on Logic Programming, San Francisco, September 1987.

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