Donald Smith. Constraint operations for clp(FT ). In Koichi Furukawa, editor, Logic Programming: Proceedings of the 8th International Conference. MIT Press, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....constraints over algebras of rational trees extends term unification, in a decidable way [Mah88, CL89] to the resolution of first order formulas with equality as unique predicate symbol. Extensions to Prolog in this line, are Prolog II [Col82] Prolog III, and more recent, systems as CLP (FT ) Smi91] where universally quantified disequalities are used to allow logic programs with constructive negation. On the other hand, as was pointed out in [DMV93] the standard algebra of rational trees has a close relationship with the standard model for features logics, Smo89] which were establish in ....

Donald Smith. Constraint operations for clp(FT ). In Koichi Furukawa, editor, Logic Programming: Proceedings of the 8th International Conference. MIT Press, 1991.

....element, the instance relation forms a complete lattice on terms modulo variable renaming. 9.1. CONSTRAINT LIFTING 9.1.3 Lifting Inequations As mentioned, in constraint lifting the common feature extraction is generalized to also include inequations. The presentation in [SH90] as well as in [Smi91] is somewhat involved and complicated. Intuitively when extracting common inequations the inequations disallowing the least number of possible term instantiations must be used. An easily understood analogy is to consider inequations over an n dimensional space. In this analogy an inequation such ....

....and while this may be simple when adding a simple constraint such as an equation, there is a lot of computation when adding a disjunction or applying negation to a complete disjunctive constraint. The problem of solving equations in the finite tree theory is handled by D. Smith in CLP(FT ) [Smi91], in this case in the general setting of the constraint logic programming (CLP) scheme, cf. JL87] In CLP(FT ) the domain is restricted to conjunctions of equations and disequations between finite trees. The difference in comparison with Colmerauer s work on Prolog II is the active solving of ....

Donald A. Smith. Constraint operations for CLP(FT). In Logic Programming: Proceedings of the 8th International Conference (Paris), pages 760--774, 1991.

....30] 3.2 CLP languages In general, each CLP language is defined with the domain(s) it covers. Some CLP languages use the domain(s) as a part of their names. This is for example as R, for real domain, FT, for domain of finite trees, and so on. The most common CLP languages are CLP(R) 27] CLP(FT) [15], CHIP [14] CAL [40] CLP(BNR) 37] CLP(F) 22] GDCC [42] Newton [21] QUADCLP(R) 39] RISCCLP(Real) 25] 26] keyedCLP [23] Trilogy [48] Prolog III [13] SICStusProlog [33] ECLiPSE [16] Each of these languages cover one domain or more. Most of them can handle linear systems of equations ....

S.A. Donald. Constraint operations for clp(ft). proceeding of the 8th international conference in logic programming, USA, 1991.

....areas. 1 CLP languages In general, each CLP language is defined with the domain(s) it covers. Some CLP languages use the domain(s) as a part of their names. This is for example as R, for real domain, FT, for domain of finite trees, and so on. The most common CLP languages are CLP(R) 18] CLP(FT) [9], CHIP [8] CAL [26] CLP(BNR) 23] CLP(F) 14] GDCC [27] Newton [13] QUADCLP(R) 25] RISCCLP(Real) 16] 17] keyedCLP [15] Trilogy [29] Prolog III [7] SICStusProlog [22] ECLiPSE [10] Each of these languages cover one domain or more. Most of them can handle linear systems of equations ....

S.A. Donald. Constraint operations for CLP(FT). proceeding of the 8th international conference in logic programming, USA, 1991.

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