Combining constraint solving
In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain-specific tasks. For this reason, various methods and systems have been developed that allow for an efficient and adequate treatment of such restricted problems. In most realistic applications, however, one is faced with a complex combination of different problems, which means that a system tailored to solving a single problem can only be applied if it is possible to combine it both with other specialized systems and with general purpose systems. For the entire collection see [Zbl 0961.00024].
- Combining symbolic constraint solvers on algebraic domains
- Tractable combinations of theories via sampling
- Metalevel algorithms for variant satisfiability
- Optimisation techniques for combing constraint solvers
- Metalevel algorithms for variant satisfiability
- Heterogeneous constraint solving
- Variant-Based Satisfiability in Initial Algebras
- Adding constraints to logic-based formalisms
- Tractable combinations of temporal CSPs
- scientific article; zbMATH DE number 7199580 (Why is no real title available?)
- Introduction to the special issue on combining constraint solving with mining and learning
- Automated Reasoning
This page was built for publication: Combining constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762630)
