Author:
Audemard Gilles,Lagniez Jean-Marie,Simon Laurent
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. STOC 1971, pp. 151–158 ACM (1971)
2. Moskewicz, M., Conor, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. DAC 2001 (2001)
3. Silva, J.P.M., Sakallah, K.: Grasp – a new search algorithm for satisfiability. In: Proc. CAD 1996, pp. 220–227 (1996)
4. Lecture Notes in Computer Science;N. Eén,2004
5. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using sat procedures instead of bdds. In: Proc. DAC 1999, pp. 317–320 (1999)
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques;Proceedings of the ACM on Programming Languages;2024-06-20
2. Combinatorial Transition Testing in Dynamically Adaptive Systems;Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems;2024-02-07
3. CaDiCaL 2.0;Lecture Notes in Computer Science;2024
4. Boosting Definability Bipartition Computation Using SAT Witnesses;Logics in Artificial Intelligence;2023
5. Combining Incomplete Search and Clause Generation: An Application to the Orienteering Problems with Time Windows;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023