Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets-Reference-Cited by-同舟云学术

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets

Published:2015 Issue: Volume: Page:70-86
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Bacchus Fahiem,Katsirelos George

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-21668-3_5

Reference24 articles.

1. Lecture Notes in Computer Science;G Audemard,2013

2. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pp. 399–404 (2009)

3. Bacchus, F., Davies, J., Tsimpoukelli, M., Katsirelos, G.: Relaxation search: a simple way of managing optional clauses. In: Proceedings of the AAAI National Conference (AAAI), pp. 835–841 (2014)

4. Belov, A., Chen, H., Mishchenko, A., Marques-Silva, J.: Core minimization in sat-based abstraction. In: Design, Automation and Test in Europe (DATE), pp. 1411–1416 (2013)

5. Lecture Notes in Computer Science;A Belov,2014

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

1. Efficiently Explaining CSPs with Unsatisfiable Subset Optimization;Journal of Artificial Intelligence Research;2023-11-25

2. Human-centred feasibility restoration in practice;Constraints;2023-06

3. Hashing-based approximate counting of minimal unsatisfiable subsets;Formal Methods in System Design;2023-04-19

4. Logic-Based Explainability in Machine Learning;Reasoning Web. Causality, Explanations and Declarative Knowledge;2023

5. Lightweight axiom pinpointing via replicated driver and customized SAT-solving;Frontiers of Computer Science;2022-08-08