Howe, J. M. & King, A. (2000). Specialising finite domain programs with polyhedra. Paper presented at the Logic Programming Synthesis and Transformation 1999, 22 - 24 September 1999, Venezia, Italy.
Download (180kB) | Preview
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 ninteger 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.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||The original publication is available at www.springerlink.com.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||School of Informatics > Department of Computing|
Actions (login required)
Downloads per month over past year