Partitioning methods for satisfiability testing on large formulas

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

Volumn 1104, Issue , 1996, Pages 748-762

  Park, Tai Joon ^a   Van Gelder, Allen ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL LOGIC; INTEGRATED CIRCUIT DESIGN; THEOREM PROVING;

AUTOMATED THEOREM PROVING; AUTOMATED VERIFICATION; CIRCUIT APPLICATION; CNF FORMULAS; HYPERGRAPH PARTITIONING; PARTITIONING METHODS; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY TESTING;

EMBEDDED SYSTEMS;

EID: 29344433408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_126     Document Type: Conference Paper

References (14)

1. [CSZ94] P.K. Chan, M.D.F. Schlag, and J.Y. Zien. "Spectral K-way ratio-cut partitioning". IEEE Transactions on Computer-Aided Design of Integrated Circuits and systems, 9:1088-1096, Sept. 1994.
2. [DLL62] M. Davis, G. Logemann, and D. Loveland. "A Machine Program for Theorem-Proving". Communications of the Association for Computing Theroy, 5:394-397, 1962.
3. [Don88] W.E. Donath. "Logic Partitioning". In in Physical Design Automation of VLSI systems, Benjamin/Cummings, pages 65-86, 1988.
4. [DP60] M. Davis and H. Putnam. "A Computing Procedure for Quantification Theory". Journal of the Association for Computing Theroy, 7:201-215, 1960.
5. [FM82] C. Fiduccia and R. Mattheyses. "A Unear-time heuristic for improving network partition". In In ACM IEEE 19th Design and Automation Conference Proceedings, pages 175-181, June, 1982.
6. [GJ79] M. Garey and D.S. Johnson. "Computers and Intractability: A Guide to Theory of NP-Completeness". M.H.Freeman, 1979.
7. [GLP93] G. Gallo, G. Longo, and S. Pallottino. "Directed Hypergraph and Applications". Discrete Applied Mathematics, 42:177-201, 1993.
8. [GU89] G. Gallo and G. Urbani. "Algorithms for Testing the Satisfiability of Propositional Formulae". Journal of Logic Programming, 7:45-61, 1989.
9. [Kah91] Andrew B. Kahng. "New Spectral Method for Ratio Cut Partitioning and Clustering". IEEE Trans, on CAD, 1991.
10. [KGV83] S. Kirkpatrick, C. Gelatt, Jr., and M. Vecchi. "Optimization by Simulated Annealing". Science, 13(220):671-680, May,1983.
11. [KL70] B.W. Kernighan and S. Lin. "An Efficient Heuristic Procedure for Partitioning Electrical Circuits". In Bell System Technical J., Feb. 1970.
12. [Lar92] T. Larrabee. "Test Pattern Generation Using Boolean Satisfiability". IEEE Transactions on Computer-Aided Design, 11:4-15, January 1992.
13. [VGT95] A. Van Gelder and Y.K. Tsuji. "Satisfiability Testing with More Reasoning and Less Guessing". In D. S. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIM ACS Implementation and Challenge., DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.
14. [WC89] Y.C. Wei and C.K. Cheng. "Towards Efficient Hierarchical Designs by Ratio Cut Partitioning". In IEEE Intl. Conf. on Computer-Aided Design, pages 298-301, 1989.