Abstract
Wire routing is the problem of determining the physical locations of all the wires interconnecting the circuit components on a chip. Since the wires cannot intersect with each other, they are competing for limited spaces, thus making routing a difficult combinatorial optimization problem. We present a new approach to wire routing that uses action languages and satisfiability planning. Its idea is to think of each path as the trajectory of a robot, and to understand a routing problem as the problem of planning the actions of several robots whose paths are required to be disjoint. The new method differs from the algorithms implemented in the existing routing systems in that it always correctly determines whether a given problem is solvable, and it produces a solution whenever one exists.
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
Roberto Bayardo and Robert Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. IJCAI-97, pages 203–208, 1997.
Hector Geffner. Causal theories for nonmonotonic reasoning. In Proc. AAAI-90, pages 524–530. AAAI Press, 1990.
Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3, 1998. http://www.ep.liu.se/ea/cis/1998/016.
Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623–630. AAAI Press, 1998.
Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.
C. Y. Lee. An algorithm for path connections and its application. IRE Transactions on Electronic Computers, EC-10:346–365, 1961.
T. Lengauer. Combinatorial Algorithms for Integrated Circuit Design. John Wiley & Sons, 1990.
Vladimir Lifschitz. Missionaries and cannibals in the causal calculator. In Principles of Knowledge Representation and Reasoning: Proc. Seventh Int’l Conf., pages 85–96, 2000.
Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460–465, 1997.
John McCarthy. Elaboration tolerance. In progress, 1999. http://www-formal.stanford.edu/jmc/elaboration.html.
T. Ohtsuki. Maze-running and line-search algorithms. In T. Ohtsuki, editor, Layout Design and Verification, chapter 3. Elsevier Science Publishers, 1986.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
Semiconductor Industry Association. The national roadmap for semiconductors, 1997.
T. G. Szymanski. Dogleg channel routing is NP-complete. IEEE Transactions on Computer-Aided Design, 4(1):31–41, 1985.
Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245–298, 1997.
Hantao Zhang. An efficient propositional prover. In Proc. CADE-97, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erdem, E., Lifschitz, V., Wong, M.D.F. (2000). Wire Routing and Satisfiability Planning. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_55
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive