The Silent (R)evolution of SAT-Reference-Cited by-同舟云学术

The Silent (R)evolution of SAT

Published:2023-05-24 Issue:6 Volume:66 Page:64-72
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Fichte Johannes K.¹,Berre Daniel Le²,Hecher Markus³,Szeider Stefan⁴

Affiliation:

1. IDA, Institutionen för datavetenskap, Linköping University, Sweden

2. Artois University and CNRS, Centre de Recherche en Informatique de Lens, France

3. Computer Science & Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA

4. TU Wien, Vienna, Austria

Abstract

Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.

Funder

Austrian Science Fund

Vienna Science and Technology Fund

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3560469

Reference40 articles.

1. Dependency solving: A separate concern in component evolution management

2. Community Structure in Industrial SAT Instances

3. Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

4. Handbook of Satisfiability

5. Bradley , A.R. SAT-based model checking without unrolling. In Verification, Model Checking, and Abstract Interpretation-12th Intern . Conf. Proceedings (Lecture Notes in Computer Science 6538) , R. Jhala and D.A. Schmidt (Eds.). Springer ( January 2011 ), 70--87. Bradley, A.R. SAT-based model checking without unrolling. In Verification, Model Checking, and Abstract Interpretation-12th Intern. Conf. Proceedings (Lecture Notes in Computer Science 6538), R. Jhala and D.A. Schmidt (Eds.). Springer (January 2011), 70--87.

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

1. Backdoor DNFs;Journal of Computer and System Sciences;2024-09

2. Strong Backdoors for Default Logic;ACM Transactions on Computational Logic;2024-06-17

3. SAT backdoors: Depth beats size;Journal of Computer and System Sciences;2024-06

4. Lazily-Verifiable SAT Proof Checker in SPARK 2014;Datenschutz und Datensicherheit - DuD;2023-07-25

5. SAT-boosted Tabu Search for Coloring Massive Graphs;ACM Journal of Experimental Algorithmics;2023-07-25