E. Monfroy and Ch. Ringeissen, `SoleX: a domainindependent scheme for constraint solver extension', in AISC'98, eds., J. Calmet and J. Plaza, LNAI 1476. Springer, (1998).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the function symbols , and . Terms may also contain ground terms which contain uninterpreted (alien) function symbols. For instance, f # (a) is a ground term containing the two uninterpreted function symbols . and f # . handles these alien terms by variable abstraction similar to [13]. Alien terms are temporarily replaced by constraint variables whose value cannot be restricted. builds a context tree whose nodes are computation spaces [16] annotated with contexts. A computation space is an abstract data type in Mozart Oz that encapsulates data, e.g. constraints and any ....

....planning causes new requirements for constraint solving that are not typically fulfilled by standard constraint solvers. Therefore, we have addressed generic extensions of a standard constraint solver. The programming language Mozart Oz is well suited for these extensions. Related Work SoleX [13] provides means for combining numerical and symbolic inference in a sequential manner. It supports the extension of the constraint language of an existing constraint solver whose soundness and completeness properties are preserved. We have adopted the SoleX approach to handle alien terms in the ....

E. Monfroy and Ch. Ringeissen, `SoleX: a domainindependent scheme for constraint solver extension', in AISC'98, eds., J. Calmet and J. Plaza, LNAI 1476. Springer, (1998).

....appropriately and correctly [13] We knew that additional features of the constraint solver are needed but did not elaborate on this. Now CoSIE has been developed based on our previous experiences with symbolic constraint solving and based on the RI module constraint solver of Mozart. SoleX [15] is a general scheme for the extension of the constraint language of an existing constraint solvers preserving soundness and completeness properties. It combines symbolic and numeric inference in a sequential way. We used the SoleX approach to handle so called alien terms in the constraint ....

E. Monfroy and Ch. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension. In J. Calmet and J. Plaza, editors, Articial Intelligence and Symbolic Computation AISC'98, LNAI 1476. Springer, 1998.

....constraints or contextual constraint solving. Also, we did not care about a generic handling of problem defined functions. Contextual rewriting also takes into consideration the context of a formula. In particular, 1] compares contextual rewriting with constraint solving. The Solex approach [9] for extending constraint solvers mainly strives at integrating a basic solver with other solvers that are able to handle domain specific constraints and alien functions by contextual rewriting, where contextual refers to the guards of constraints. This approach does not deal with the other ....

....a basic solver with other solvers that are able to handle domain specific constraints and alien functions by contextual rewriting, where contextual refers to the guards of constraints. This approach does not deal with the other requirements we addressed here. Many of the extensions described in [9] are already implemented in the standard Oz constraint solvers. As for the cooperation of several solvers, there exists several approaches in [11, 6, 10] ....

E. Monfroy and Ch. Ringeissen. SoleX: a domain-independent scheme for constraint solver extension. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation AISC'98, number 1476 in Lecture Notes in Artificial Intelligence, pages 222--233. Springer, 1998.

....then processed by the available constraint solver for Presburger Arithmetic. The situation is complicated by the need of discretizing, since R is a continuous domain. However, in QUAD CLP(R) no attempt is done to generalize the approach w.r.t. the domain of the available constraint solver. SoleX [16] is a mechanism for the domain independent extension of constraint 8 following the paradigm proposed in [21] 13 solvers so to deal with programmer de ned constraints. This work resembles ours in allowing interpreted function symbols by means of guarded rewrite rules and in being domain ....

E. Monfroy and C. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension. In 4 th Intl. Conf. on Articial Intelligence and Symbolic Computation (AISC'98). Plattsburgh, New York, September, pages 222-233, 1998.

....to specify reasoning modules, and in the de nition of the rules we stress the distinction between logic and control. Many extensions to constraint solving aiming at a better trade o between declarativity and e ciency have been put forward in Constraint Programming (CP) In particular, SoleX [11] is a mechanism for the domain independent extension of constraint solvers so to deal with programmer de ned constraints. This work resembles ours in the rule based presentation, in the semantical extension of the constraint rules by means of guarded rewrite rules, and in being domain independent. ....

E. Monfroy and C. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension. In 4 th Intl. Conf. on Articial Intelligence and Symbolic Computation (AISC'98). Plattsburgh, New York, September, 1998.

....primitives can perform the following tasks: they can eliminate the disjuncts that are above the current best solution, and also manage the updating of the current best solution. Branching can, thus, be improved and performed sooner. The constraint solver extension mechanism of SoleX [24] consists of rule based transformations seen as elementary solvers. Until now, the implementation of SoleX with BALI was not really conceivable: rule based transformations are too fine grain solvers to be encapsulated. With the new model, the implementation of SoleX becomes reasonable. Finally, ....

Monfroy, E., and Ringeissen, C. SOLEX: a Domain-Independent Scheme for Constraint Solver Extension. In Proc. of the Fourth International Conference on Artificial Intelligence and Symbolic Computation (AISC'98) (Sep. 1998), no. 1476 in Lecture Notes in Artificial Intelligence, Springer Verlag.

....of controlling solvers. Section 5 describes some applications of SoleX over different domains. Finally, we conclude comparisons, conclusions and future works are discussed in Section 6. A longer version of this paper including a formalization of the related transformation rules may be found in [13]. 2 Basic Concepts Let us first introduce some standard notations about terms and substitutions of variables by terms. Given a first order signature Sigma and a denumerable set V of variables, T ( Sigma ; V) denotes the set of F Sigma terms with variables in V . Terms (resp. variables) are ....

....0 3. ExtSolve = Contraction ffi Solve ffi Expansion is a solver such that ExtSolve(C; P ) C 0 ; P 0 ) C C 0 The proof is quite obvious since SoleX is ExtSolve ffi Reduction and we assume a complexity measure that does not increase by Reduction but strictly decreases by ExtSolve (see [13] for more details about a possible ordering) Remark 2. One can find in [13] some sufficient conditions to insure that ExtSolve (respectively TermRed, and ConsRed) is a solver. 5 Applications Inverse Robot Kinematics We can now solve the problem [3] briefly described in Section 1. This problem ....

[Article contains additional citation context not shown here]

E. Monfroy and C. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension (Extended Version). Research report, INRIA, Jun. 1996. Also available at url http://www.inria.fr/RRRT/publications-eng.html.

....primitives can perform the following tasks: they can eliminate the disjuncts that are above the current best solution, and also manage the updating of the current best solution. Branching can, thus, be improved and performed sooner. The constraint solver extension mechanism of SoleX [24] consists of rule based transformations seen as elementary solvers. Until now, the implementation of SoleX with BALI was not really conceivable: rule based transformations are too fine grain solvers to be encapsulated. With the new model, the implementation of SoleX becomes reasonable. Finally, ....

Monfroy, E., and Ringeissen, C. SOLEX: a Domain-Independent Scheme for Constraint Solver Extension. In Proc. of the Fourth International Conference on Artificial Intelligence and Symbolic Computation (AISC'98) (Sep. 1998), no. 1476 in Lecture Notes in Artificial Intelligence, Springer Verlag.

No context found.

E. Monfroy and Ch. Ringeissen. SoleX: a domain-independent scheme for constraint solver extension. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation AISC'98, number 1476 in Lecture Notes in Artificial Intelligence, pages 222--233. Springer, 1998.

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