CLP(Flex): Constraint Logic Programming Applied to XML Processing
نویسندگان
چکیده
In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symbols. Then we present an application of CLP(Flex) to XML-processing where XML documents are abstracted by terms with flexible arity symbols. This gives a highly declarative model for XML processing yielding a substantial degree of flexibility in programming.
منابع مشابه
XML Processing and Logic Programming
In this paper we describe a constraint solving module which we call CLP(Flex), for dealing with the unification of terms with flexible arity function symbols. This approach results in a flexible and high declarative model for XML processing.
متن کامل1 The logic programming paradigm in numerical computation
Although CLP(R) is a promising application of the logic programming paradigm to numerical computation, it has not addressed what has long been known as “the pitfalls of [numerical] computation” [12]. These show that rounding errors induce a severe correctness problem wherever floating-point computation is used. Independently of logic programming, constraint processing has been applied to proble...
متن کاملThe Logic Programming Paradigm in Numerical Computation
Although CLP(R) is a promising application of the logic programming paradigm to numerical computation, it has not addressed what has long been known as \the pitfalls of numerical] computation" 12]. These show that rounding errors induce a severe correctness problem wherever oating-point computation is used. Independently of logic programming, constraint processing has been applied to problems i...
متن کاملA Look At Clp: Theory and Application
Constraint Logic Programming (CLP) is a relatively new programming paradigm. During its ten years of existence, the theory of CLP has been increasingly understood and the two diierent approaches, domain technology and incremental linear solving, have been implemented in various CLP systems. Meanwhile, the commercial attractivity of CLP has been growing. Since 1989 a couple of commercial CLP sys...
متن کاملDesign and Implementation of Practical Constraint Logic Programming Systems
The Constraint Logic Programming (CLP) scheme, developed by Jaffar and Lassez, defines a class of rule–based constraint programming languages. These generalize traditional logic programming languages (like Prolog) by replacing the basic operational step, unification, with constraint solving. While CLP languages have a tremendous advantage in terms of expressive power, they must be shown to be a...
متن کامل