z-logo
open-access-imgOpen Access
Accelerating SAT Solving by Common Subclause Elimination
Author(s) -
Yaowei Yan,
Chris Gutierrez,
Jeriah Jn-Charles,
Forrest Sheng Bao,
Yuanlin Zhang
Publication year - 2015
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v29i1.9732
Subject(s) - boolean satisfiability problem , computer science , satisfiability , theoretical computer science , maximum satisfiability problem , algorithm , boolean function

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom