@inproceedings{07b3de034d914b08ac13a2fd01859cf7,
title = "Accelerating SAT solving by common subclause elimination",
abstract = "Boolean SATisfiability (SAT) is an important problem in AI. SAT solvers have been effectively used in important industrial applications including automated planning and verification. In this paper, we present novel algorithms for fast SAT solving by employing two common subclause elimination (CSE) approaches. Our motivation is that modern SAT solving techniques can be more efficient on CSE-processed instances. Empirical study shows that CSE can significantly speed up SAT solving.",
author = "Yaowei Yan and Gutierrez, {Chris E.} and Jeriah Jn-Charles and Bao, {Forrest S.} and Yuanlin Zhang",
note = "Publisher Copyright: {\textcopyright} Copyright 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; null ; Conference date: 25-01-2015 Through 30-01-2015",
year = "2015",
month = jun,
day = "1",
language = "English",
series = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AI Access Foundation",
pages = "4224--4225",
booktitle = "Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015",
}