Rectilinear steiner tree construction using answer set programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3132, Issue , 2004, Pages 386-399

  Erdem, Esra ^a   Wong, Martin D F ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b United States of America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; TREES (MATHEMATICS);

ANSWER SET; ANSWER SET PROGRAMMING; FORMAL REPRESENTATIONS; LOGIC PROGRAMS; RECTILINEAR STEINER TREES; ROUTING PROBLEMS; TOTAL WIRE LENGTH; VLSI ROUTING;

PROBLEM SOLVING;

EID: 33750084885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_27     Document Type: Article

References (21)

1. Hanan, M.: On Steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics 14 (1966) 255-265
2. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP complete. SIAM Journal of Applied Mathematics 32 (1977) 826-834
3. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective. (1999) 375-398
4. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138 (2002) 181-234
5. Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138 (2002) 39-54
6. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming: Proc. of the Fifth Int'l Conference and Symposium. (1988) 1070-1080
7. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991) 365-385
8. Hanan, M.: Net wiring for large scale integrated circuits. Tech. report, IBM (1965)
9. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Design. (1990)
10. Nielsen, B.K., Winter, P., Zachariasen, M.: An exact algorithm for the uniformlyoriented steiner tree problem. In: Proc. of ESA-10 (2002) 760-771
11. Zhou, H.: Efficient steiner tree construction based on spanning graphs. In: ACM Int'l Symposium on Physical Design. (2003)
12. Warme, D.M.: A new exact algorithm for rectilinear steiner trees. In the Int'l Symposium on Mathematical Programming (1997)
13. Zachariasen, M.: Rectilinear full steiner tree generation. Networks 33 (1999) 125-143
14. Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proc. of the Int'l Symposium on Circuits and Systems. (1994) 113-116
15. McCarthy, J.: Elaboration tolerance. In progress (1999)
16. Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming 3 (2003) 499-518
17. Lloyd, J.: Foundations of Logic Programming. (1984)
18. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer sets solver enhanced to non-tight programs. In: Proc. of LPNMR-7. (2004) 346-350
19. Erdem, E., Lifschitz, V., Wong, M.: Wire routing and satisfiability planning. In: Proc. of the First Int'l Conference on Computational Logic. (2000) 822-836
20. Erdem, E.: Theory and Applications of Answer Set Programming. PhD thesis, University of Texas at Austin (2002), Department of Computer Sciences.
21. East, D., Truszczyński, M.: More on wire routing with ASP. In: Working Notes of the AAAI Spring Symposium on Answer Set Programming. (2001)