Partitioning methods for satisfiability testing on large formulas

  • Tai Joon Park
  • Allen Van Gelder
Session 9B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)


A propositional satisfiability tester is needed as a subroutine for many applications in automated verification, automated theorem proving, and other fields. Such applications may generate very large formulas, some of which are beyond the capabilities of known algorithms. This paper investigates methods for partitioning such formulas effectively, to produce smaller formulas within the reach of known algorithms. CNF formula partitioning can be viewed as hypergraph partitioning, which has been studied extensively in VLSI design. Although CNF formulas have been considered as hypergraphs before, we found that this viewpoint was not productive for partitioning, and we introduce a new viewpoint in the dual hypergraph. Hypergraph partitioning technology from VLSI design is adapted to this problem. The overall goal of satisfiability testing requires criteria different from those used in VLSI design. Several heuristics are described, and investigated experimentally. Some formulas from circuit applications that were extremely difficult or impossible for existing algorithms have been solved. However, the method is not useful on formulas with little or no “structure”, such as randomly generated formulas.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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.CrossRefGoogle Scholar
  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.Google Scholar
  3. [Don88]
    W.E. Donath. “Logic Partitioning”. In in Physical Design Automation of VLSI systems, Benjamin/Cummings, pages 65–86, 1988.Google Scholar
  4. [DP60]
    M. Davis and H. Putnam. “A Computing Procedure for Quantification Theory”. Journal of the Association for Computing Theroy, 7:201–215, 1960.Google Scholar
  5. [FM82]
    C. Fiduccia and R. Mattheyses. “A linear-time heuristic for improving network partition”. In In ACM IEEE 19th Design and Automation Conference Proceedings, pages 175–181, June, 1982.Google Scholar
  6. [GJ79]
    M. Garey and D.S. Johnson. “Computers and Intractability: A Guide to Theory of NP-Completeness”. M.H.Freeman, 1979.Google Scholar
  7. [GLP93]
    G. Gallo, G. Longo, and S. Pallottino. “Directed Hypergraph and Applications”. Discrete Applied Mathematics, 42:177–201, 1993.CrossRefGoogle Scholar
  8. [GU89]
    G. Gallo and G. Urbani. “Algorithms for Testing the Satisfiability of Propositional Formulae”. Journal of Logic Programming, 7:45–61, 1989.CrossRefGoogle Scholar
  9. [Kah91]
    Andrew B. Kahng. “New Spectral Method for Ratio Cut Partitioning and Clustering”. IEEE Trans. on CAD, 1991.Google Scholar
  10. [KGV83]
    S. Kirkpatrick, C. Gelatt, Jr., and M. Vecchi. “Optimization by Simulated Annealing”. Science, 13(220):671–680, May, 1983.Google Scholar
  11. [KL70]
    B.W. Kernighan and S. Lin. “An Efficient Heuristic Procedure for Partitioning Electrical Circuits”. In Bell System Technical J., Feb. 1970.Google Scholar
  12. [Lar92]
    T. Larrabee. “Test Pattern Generation Using Boolean Satisfiability”. IEEE Transactions on Computer-Aided Design, 11:4–15, January 1992.CrossRefGoogle Scholar
  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 DIMACS Implementation and Challenge., DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.Google Scholar
  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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Tai Joon Park
    • 1
  • Allen Van Gelder
    • 1
  1. 1.Computer Science Dept., 225 ASUniversity of CaliforniaSanta CruzUSA

Personalised recommendations