MCS Extraction with Sublinear Oracle Queries-Reference-Cited by-同舟云学术

MCS Extraction with Sublinear Oracle Queries

Published:2016 Issue: Volume: Page:342-360
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2016
language:
Short-container-title:

Author:

Mencía Carlos,Ignatiev Alexey,Previti Alessandro,Marques-Silva Joao

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-40970-2_21

Reference39 articles.

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

2. Lecture Notes in Computer Science;F Bacchus,2015

3. Lecture Notes in Computer Science;J Bailey,2005

4. Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. In: IJCAI, pp. 276–281 (1993)

5. Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97–116 (2012)

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

1. Computing MUS-Based Inconsistency Measures;Logics in Artificial Intelligence;2023

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

3. Chapter 4. Conflict-Driven Clause Learning SAT Solvers;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. From Contrastive to Abductive Explanations and Back Again;AIxIA 2020 – Advances in Artificial Intelligence;2021

5. SAT-Based Rigorous Explanations for Decision Lists;Theory and Applications of Satisfiability Testing – SAT 2021;2021