A Semantic Basis for Specialising Domain Constraints

Howe, Jacob M. and King, Andy (1999) A Semantic Basis for Specialising Domain Constraints. University of Kent, School of Computing, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, 12 pp. (Full text available)

PDF
Download (200kB) Preview	Preview

Abstract

This paper formalises an analysis of finite domain programs and the resultant program transformation. The analysis adds low valency (domain) constraints to clauses in order to reduce search. The technique is outlined with a worked example and then formalised using abstract interpretation. Correctness of the analysis and of the transformation is proved.

Item Type:	Research report (external)
Additional information:	Presented at the International Workshop for Object-oriented and Constraint Programming for Time Critical Applications, Lisbon, Portugal
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User:	Andy King
Date Deposited:	08 Sep 2009 14:48 UTC
Last Modified:	28 May 2014 09:01 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21749 (The current URI for this page, for reference purposes)