Between SAT and UNSAT: The Fundamental Difference in CDCL SAT-Reference-Cited by-同舟云学术

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT

Published:2015 Issue: Volume: Page:307-323
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Oh Chanseok

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-24318-4_23

Reference36 articles.

1. Aigner, M., Biere, A., Kirsch, C.M., Niemetz, A., Preiner, M.: Analysis of portfolio-style parallel SAT solving on current multi-core architectures. In: POS (2013)

2. Alfonso, E.M., Manthey, N.: Riss 4.27 BlackBox. In: SAT-COMP (2014)

3. Lecture Notes in Computer Science;G Audemard,2011

4. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI (2009)

5. Audemard, G., Simon, L.: Glucose 2.1: aggressive but reactive clause database management, dynamic restarts. In: POS (2012)

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep Combination of CDCL(T) and Local Search for Satisfiability Modulo Non-Linear Integer Arithmetic Theory;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-04-12

2. From Clauses to Klauses;Lecture Notes in Computer Science;2024

3. Picky CDCL: SMT-Solving with Flexible Literal Selection;Lecture Notes in Computer Science;2024

4. SATformer: Transformer-Based UNSAT Core Learning;2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD);2023-10-28

5. A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper);Automated Deduction – CADE 29;2023