Skip to main content

Specialising Finite Domain Programs using Polyhedra

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 . Springer-Verlag, pp. 118-135. ISBN 978-3-540-67628-7. (KAR id:22049)

Language: English
Click to download this file (210kB) Preview
[thumbnail of Specialising_Finite_Domain_Programs_using_Polyhedra.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format


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: Book section
Additional information: Copyright Springer-Verlag, see
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 30 Aug 2009 19:08 UTC
Last Modified: 16 Nov 2021 10:00 UTC
Resource URI: (The current URI for this page, for reference purposes)
King, Andy:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.