Author:
Marques-Silva Joao,Janota Mikoláš,Belov Anton
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Lecture Notes in Artificial Intelligence;Z.S. Andraus,2008
2. Lecture Notes in Computer Science;J. Bailey,2005
3. Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. In: IJCAI, pp. 276–281 (1993)
4. Lecture Notes in Computer Science;A. Belov,2012
5. Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97–116 (2012)
Cited by
40 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. On computing probabilistic abductive explanations;International Journal of Approximate Reasoning;2023-08
3. Which of My Assumptions are Unnecessary for Realizability and Why Should I Care?;2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE);2023-05
4. Logic-Based Explainability in Machine Learning;Reasoning Web. Causality, Explanations and Declarative Knowledge;2023
5. Timed Automata Robustness Analysis via Model Checking;Logical Methods in Computer Science;2022-07-29