Smallest MUS Extraction with Minimal Hitting Set Dualization-Reference-Cited by-同舟云学术

Smallest MUS Extraction with Minimal Hitting Set Dualization

Published:2015 Issue: Volume: Page:173-182
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ignatiev Alexey,Previti Alessandro,Liffiton Mark,Marques-Silva Joao

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23219-5_13

Reference19 articles.

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

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

3. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)

4. Chandrasekaran, K., Karp, R.M., Moreno-Centeno, E., Vempala, S.: Algorithms for implicit hitting set problems. In: SODA, pp. 614–629 (2011)

5. Lecture Notes in Computer Science;A Cimatti,2013

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

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

2. ASP and subset minimality: Enumeration, cautious reasoning and MUSes;Artificial Intelligence;2023-07

3. GNN Based Extraction of Minimal Unsatisfiable Subsets;Inductive Logic Programming;2023

4. Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks;Tools and Algorithms for the Construction and Analysis of Systems;2023

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