POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Applications of Gro¨bner bases in non-linear computational geometry
Geometric reasoning
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining symbolic constraint solvers on algebraic domains
Journal of Symbolic Computation
The Mathematica book (3rd ed.)
The Mathematica book (3rd ed.)
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Implementing non-linear constraints with cooperative solvers
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Contraint Logic Programming - An Informal Introduction
LPSS '92 Proceedings of the Second International Logic Programming Summer School on Logic Programming in Action
Extending RISC-CLP (Real) to Handle Symbolic Functions
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Combining Local Consistency, Symbolic Rewriting and Interval Methods
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
Specification and Integration of Theorem Provers and Computer Algebra Systems
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Combining Theorem Proving and Symbolic Mathematical Computing
AISMC-2 Selected Papers from the Second International Conference on Integrating Symbolic Mathematical Computation and Artificial Intelligence
| Hi-index | 0.00 |
In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We propose a domain-independent scheme to extend constraint solvers so that they can handle alien constraints, i.e., constraint involving new function symbols. This mechanism, called SoleX, consists of a set of symbolic rule-based transformations: they add and deduce syntactical as well as semantic information related to alien constraints, complete the computation domain, and purify constraints in order to allow solvers to cope with alien constraints. These transformations can be seen as elementary solvers, and thus, SoleX is a collaboration of these several solvers with the initial solver. Some extensions of computation domains have already been studied to demonstrate the broad scope of SoleX potential applications.