A branching heuristic for SAT solvers based on complete implication graphs
Crossref DOI link: https://doi.org/10.1007/s11432-017-9467-7
Published Online: 2019-04-17
Published Print: 2019-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Xiao, Fan
Li, Chu-Min
Luo, Mao
Manyà, Felip
Lü, Zhipeng
Li, Yu
Text and Data Mining valid from 2019-04-17
Version of Record valid from 2019-04-17
Article History
Received: 24 November 2017
Revised: 5 February 2018
Accepted: 20 March 2018
First Online: 17 April 2019