Crossmark

Accelerating Boolean Satisfiability (SAT) solving by common subclause elimination

Published Online: 2017-01-11

Published Print: 2018-03

Authors

Bao, Forrest Sheng

Gutierrez, Chris

Jn Charles-Blount, Jeriah

Yan, Yaowei

Zhang, Yuanlin
Funding

Funding for this research was provided by:

National Science Foundation (CNS-1359359, MCB-1616216)

National Science Foundation (IIS-1018031)
License Information

Text and Data Mining valid from 2017-01-11

Version of Record valid from 2017-01-11
More Information

Article History

First Online: 11 January 2017

Document is current