Author:
Belov Anton,Heule Marijn J. H.,Marques-Silva Joao
Publisher
Springer International Publishing
Reference25 articles.
1. Lecture Notes in Computer Science;J. Marques-Silva,2013
2. Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Communications 25(2), 97–116 (2012)
3. Nadel, A., Ryvchin, V., Strichman, O.: Efficient MUS extraction with resolution. In: [24], pp.197–200
4. Audemard, G., Lagniez, J.M., Simon, L.: Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction, In: [25], pp. 309–317
5. Lagniez, J.M., Biere, A.: Factoring out assumptions to speed up MUS extraction. In: [25], pp. 276–292
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Backdoor DNFs;Journal of Computer and System Sciences;2024-09
2. Hashing-based approximate counting of minimal unsatisfiable subsets;Formal Methods in System Design;2023-04-19
3. An Incomplete Unsatisfiable Cores Extracting Algorithm to Promote Routing;2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS);2021-12
4. Chapter 15. Proofs of Unsatisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02
5. Counting Minimal Unsatisfiable Subsets;Computer Aided Verification;2021