Specialising Finite Domain Programs using Polyhedra

Howe, J.M. and King, A. (2000) Specialising Finite Domain Programs using Polyhedra. In: Bossi, A., ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817. Springer-Verlag pp. 118-135. ISBN 978-3-540-67628-7.

Other (gz)
Download (64Kb)
PDF
Download (183Kb)	Preview

Abstract

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.

Item Type:	Conference or workshop item (Paper)
Additional information:	Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	30 Aug 2009 19:08
Last Modified:	06 Sep 2011 04:11
Resource URI:	http://kar.kent.ac.uk/id/eprint/22049 (The current URI for this page, for reference purposes)

• Depositors only (login required):