Towards backbone computing: A Greedy-Whitening based approach

@article{Zhang2018TowardsBC,
  title={Towards backbone computing: A Greedy-Whitening based approach},
  author={Yueling Zhang and Min Zhang and Geguang Pu and Fu Song and Jianwen Li},
  journal={AI Commun.},
  year={2018},
  volume={31},
  pages={267-280}
}
Backbone is the set of literals that are true in all formula's models. Computing a part of backbone efficiently could guide the following searching in SAT solving and accelerate the process, which is widely used in fault localization, product configuration, and formula simplification. Specifically, iterative SAT testings among literals are the most time consumer in backbone computing. We propose a Greedy-Whitening based algorithm in order to accelerate backbone computing. On the one hand, we… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Experimental analysis of backbone computation algorithms

M. Janota, I. Lynce, J. Marques-Silva
  • in: International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA)
  • 2012
VIEW 1 EXCERPT

Accelerating MUS extraction with recursive model rotation

  • 2011 Formal Methods in Computer-Aided Design (FMCAD)
  • 2011
VIEW 1 EXCERPT