This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines. However most constraint solvers are designed to be general and monolithic, leading to problems with efficiency, scalability and extensibility. We propose a novel, architecture-driven constraint solver generation framework called Dominion to tackle these issues. For any given problem, Dominion generates a lean and efficient solver tailored to that problem. In this paper, we outline the Dominion approach and its implications for software architecture specification of the solver.Postprin
Our research is based on Constraint Handling Rules (CHR), a powerful language for writing constraint...
Constraints, in various forms, are ubiquitous to design problems. In this paper, we provide a formal...
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisat...
Constraints are used to solve combinatorial problems in a variety of industrial and academic discipl...
Combinatorial problems appear in numerous settings, from timetabling to industrial design. Constrain...
Abstract. Designing component-based constraint solvers is a complex problem. Some components are req...
Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) ...
Many and diverse combinatorial problems have been solved successfully using finite-domain constrain...
This research focuses on an approach to describe principles in architectural layout planning within ...
Constraint Programming (CP) is a powerful technology to solve combinatorial problems which are ubiqu...
This research focuses on an approach to describe principles in architectural layout planning within ...
Funding: Engineering and Physical Sciences Research Council (EP/V027182/1, EP/P015638/1), Royal Soci...
The computation power we expect from the various smart devices we use keeps increasing. Not only do ...
. Applying constraint-based problem solving methods in a new domain often requires considerable work...
Most automated reasoning tasks with prac tical applications can be automatically reformulated into a...
Our research is based on Constraint Handling Rules (CHR), a powerful language for writing constraint...
Constraints, in various forms, are ubiquitous to design problems. In this paper, we provide a formal...
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisat...
Constraints are used to solve combinatorial problems in a variety of industrial and academic discipl...
Combinatorial problems appear in numerous settings, from timetabling to industrial design. Constrain...
Abstract. Designing component-based constraint solvers is a complex problem. Some components are req...
Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) ...
Many and diverse combinatorial problems have been solved successfully using finite-domain constrain...
This research focuses on an approach to describe principles in architectural layout planning within ...
Constraint Programming (CP) is a powerful technology to solve combinatorial problems which are ubiqu...
This research focuses on an approach to describe principles in architectural layout planning within ...
Funding: Engineering and Physical Sciences Research Council (EP/V027182/1, EP/P015638/1), Royal Soci...
The computation power we expect from the various smart devices we use keeps increasing. Not only do ...
. Applying constraint-based problem solving methods in a new domain often requires considerable work...
Most automated reasoning tasks with prac tical applications can be automatically reformulated into a...
Our research is based on Constraint Handling Rules (CHR), a powerful language for writing constraint...
Constraints, in various forms, are ubiquitous to design problems. In this paper, we provide a formal...
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisat...