Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
Knowledge-based algorithm construction for real-world engineering PDEs
Selected papers presented at the third international conference on Expert systems for scientific computing
High-level optimization via automated statistical modeling
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Software architecture: perspectives on an emerging discipline
Software architecture: perspectives on an emerging discipline
A Classification and Comparison Framework for Software Architecture Description Languages
IEEE Transactions on Software Engineering
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Synthesis of efficient constraint-satisfaction programs
The Knowledge Engineering Review
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Synthesis of constraint-based local search algorithms from high-level models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Synthesizing customized planners from specifications
Journal of Artificial Intelligence Research
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
EasySyn++: a tool for automatic synthesis of stochastic local search algorithms
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Maintaining state in propagation solvers
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
Dynamic constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers
WICSA '11 Proceedings of the 2011 Ninth Working IEEE/IFIP Conference on Software Architecture
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
Combinatorial problems appear in numerous settings, from timetabling to industrial design. Constraint solving aims to find solutions to such problems efficiently and automatically. Current constraint solvers are monolithic in design, accepting a broad range of problems. The cost of this convenience is a complex architecture, inhibiting efficiency, extensibility and scalability. Solver components are also tightly coupled with complex restrictions on their configuration, making automated generation of solvers difficult. We describe a novel, automated, model-driven approach to generating efficient solvers tailored to individual problems and present some results from applying the approach. The main contribution of this work is a solver generation framework called Dominion, which analyses a problem and, based on its characteristics, generates a solver using components chosen from a library. The key benefit of this approach is the ability to solve larger and more difficult problems as a result of applying finer-grained optimisations and using specialised techniques as required.