• DocumentCode
    454442
  • Title

    Strong Conflict Analysis for Propositional Satisfiability

  • Author

    Jin, HoonSang ; Somenzi, Fabio

  • Volume
    1
  • fYear
    2006
  • fDate
    6-10 March 2006
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We present a new approach to conflict analysis for propositional satisfiability solvers based on the DPLL procedure and clause recording. When conditions warrant it, we generate a supplemental clause from a conflict. This clause does not contain a unique implication point, and therefore cannot replace the standard conflict clause. However, it is very effective at reducing excessive depth in the implication graphs and at preventing repeated conflicts on the same clause. Experimental results show consistent improvements over state-of-the-art solvers and confirm our analysis of why the new technique works
  • Keywords
    computability; David-Putnam-Logemann-Loveland procedure; clause recording; conflict analysis; propositional satisfiability solvers; standard conflict clause; Algorithm design and analysis; Business continuity; Computer aided engineering; Computer science; Contracts; Electronic design automation and methodology; Large scale integration; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design, Automation and Test in Europe, 2006. DATE '06. Proceedings
  • Conference_Location
    Munich
  • Print_ISBN
    3-9810801-1-4
  • Type

    conf

  • DOI
    10.1109/DATE.2006.244149
  • Filename
    1657002