CLP Techniques For Channel Routing

Copyright cIntelligent Software Group, Simon Fraser University.This work may not be copied or reproduced in whole or in part for any commercial purpose. Permissionto copy in whole or in part without payment of fee is granted for non-profit educational and research pur-poses provided that all such whole or partial copies include the following: a notice that such copying is bypermission of the Intelligent Software Group (ISG) of Simon Fraser University (SFU), in Burnaby, BritishColumbia (Canada); an acknowledgement of the authors and individual contributorsto the work; and all ap-plicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shallrequire a license with payment of fee to the Intelligent Software Group. All rights reserved.ii

[1]  Frank Thomson Leighton,et al.  Nearly optimal algorithms and bounds for multilayer channel routing , 1995, JACM.

[2]  Andreas Podelski,et al.  Towards a Meaning of LIFE , 1991, J. Log. Program..

[3]  Neng-Fa Zhou.  A Logic Programming Approach to Channel Routing , 1995, ICLP.

[4]  Wu-Shiung Feng,et al.  A new efficient approach to multilayer channel routing problem , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[5]  Xingzhao Liu,et al.  Genetic Channel Router , 1994 .

[6]  Philippe Codognet,et al.  A Minimal Extension of the WAM for clp(FD) , 1993, ICLP.

[7]  Michael Kaufmann,et al.  Channel routing of multiterminal nets , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Andreas Podelski,et al.  Functions as passive constraints in LIFE , 1994, TOPL.

[9]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.