Abstract
In this paper we show, for the specific problem of test pattern optimisation, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone. We show that a tool we developed to solve this problem using such approach with multivalued logics achieves better results than those obtained with a highly efficient tool based on an integer linear programming formulation over a SAT model.
Financially supported by “Sub-Programa Ciěncia e Tecnologia do 2° Quadro Comunitário de Apoio”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Simonis. Test Generation using the Constraint Logic Programming Language CHIP, 6th Int. Conf. on Logic Programming, MIT Press, 101–112, 1989.
S. Hellebrand, B. Reeb, S. Tarnick and H.-J. Wunderlich. Pattern Generation for a Deterministic BIST Scheme, Int. Conf. on Computer-Aided Design, 1995.
Paulo F. Flores, Horácio C. Neto, Krishnendu Chakrabarty and João P. Marques-Silva. A Model and Algorithm for Computing Minimum-Size Test Patterns, in IEEE European Test Workshop (ETW), 147–148, May 1998.
Paulo F. Flores, Horácio C. Neto and João P. Marques-Silva. An Exact Solution to the Minimum-Size Test Pattern Problem, in IEEE/ACM Int. Ws on Logic Synthesis (IWLS), 452–470, 1998.
ECRC, ECLiPSe user manual and extensions, Technical Report, ECRC, 1994.
Programming Systems Group of the Swedish Institute of Computer Science. SICStus Prolog User’s Manual, 1995.
ISCAS. Special Session on ATPG, IEEE Symp. Circuits and Systems, 1985.
H. K. Lee and D. S. Ha, On the Generation of Test Patterns for Combinational Circuits, Technical Report No. 12_93, Department of Electrical Engineering, Virginia Polytechnic Institute and State University, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azevedo, F., Barahona, P. (2001). Interaction of Constraint Programming and Local Search for Optimisation Problems. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_38
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive