On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers (0)
Cached
Download Links
- [ftp.cis.uni-muenchen.de]
- [ftp.cis.uni-muenchen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the First International Conference on Principles and Practice of Constraint Programming |
| Citations: | 23 - 3 self |
BibTeX
@INPROCEEDINGS{Baader_onthe,
author = {Franz Baader and Klaus U. Schulz},
title = {On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers},
booktitle = {In Proceedings of the First International Conference on Principles and Practice of Constraint Programming},
year = {},
pages = {380--397},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
When combining languages for symbolic constraints, one is typically faced with the problem of how to treat "mixed" constraints. The two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving methods for pure constraints into one for mixed constraints. The paper introduces the notion of a "free amalgamated product" as a possible solution to the first problem. Subsequently, we define so-called simply-combinable structures (SC-structures). For SC-structures over disjoint signatures, a canonical amalgamation construction exists, which for the subclass of strong SC-structures yields the free amalgamated product. The combination technique of [BS92, BaS94a] can be used to combine constraint solvers for (strong) SC-structures over disjoint signatures into a solver for their (free) amalgamated product. In addition to term algebras modulo equational theories, the class of SC-stru...
