Howe, J.M. and King, A.
Specialising Finite Domain Programs using Polyhedra.
In: Bossi, A., ed.
Lecture Notes In Computer Science.
Lecture Notes in Computer Science, 1817.
(Full text available)
A procedure is described for tightening domain constraints of finite domain logic programs by applying a static analysis based on convex polyhedra. Individual finite domain constraints are over-approximated by polyhedra to describe the solution space over n integer variables as an n dimensional polyhedron. This polyhedron is then approximated, using projection, as an n dimensional bounding box that can be used to specialise and improve the domain constraints. The analysis can be implemented straightforwardly and an empirical evaluation of the specialisation technique is given.
- Depositors only (login required):