Howe, Jacob M. and King, Andy (1999) Specialising Finite Domain Programs using Polyhedra. In: Bossi, Annalisa, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817 . SpringerVerlag, pp. 118135. ISBN 9783540676287. (Full text available)
Download (187kB)


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 overapproximated 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:  Book section 

Additional information:  Copyright SpringerVerlag, 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:  Andy King 
Date Deposited:  30 Aug 2009 19:08 
Last Modified:  28 May 2014 09:00 
Resource URI:  https://kar.kent.ac.uk/id/eprint/22049 (The current URI for this page, for reference purposes) 
 Export to:
 RefWorks
 EPrints3 XML
 CSV
 Depositors only (login required):
Downloads
Downloads per month over past year