Author:
Bendík Jaroslav,Černá Ivana,Beneš Nikola
Publisher
Springer International Publishing
Reference37 articles.
1. Zaher, S.A., Mark, HL., Karem A.S.: Cegar-based formal hardware verification: a case study. Ann Arbor (2007)
2. Bacchus, F., Katsirelos, G.: Using minimal correction sets to more efficiently compute minimal unsatisfiable sets. In: Kroening, Daniel, Păsăreanu, Corina S. (eds.) CAV (2). LNCS, vol. 9207, pp. 70–86. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21668-3_5
3. Bacchus, F., Katsirelos, G.: Finding a collection of MUSes incrementally. In: CPAIOR (2016)
4. Lecture Notes in Computer Science;J Bailey,2005
5. Barnat, J., Bauch, P., Beneš, N., Brim, L., Beran, J., Kratochvíla, T.: Analysing sanity of requirements for avionics systems. Formal Aspects of Computing (2016)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Regular Abstractions for Array Systems;Proceedings of the ACM on Programming Languages;2024-01-05
2. Flexible and Robust Counterfactual Explanations with Minimal Satisfiable Perturbations;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21
3. Hashing-based approximate counting of minimal unsatisfiable subsets;Formal Methods in System Design;2023-04-19
4. Computing MUS-Based Inconsistency Measures;Logics in Artificial Intelligence;2023
5. Logic-Based Explainability in Machine Learning;Reasoning Web. Causality, Explanations and Declarative Knowledge;2023