Factoring Out Assumptions to Speed Up MUS Extraction-Reference-Cited by-同舟云学术

Factoring Out Assumptions to Speed Up MUS Extraction

Published:2013 Issue: Volume: Page:276-292
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2013
language:
Short-container-title:

Author:

Lagniez Jean-Marie,Biere Armin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39071-5_21

Reference38 articles.

1. Lecture Notes in Computer Science;N. Eén,2004

2. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. ENTCS 89(4), 543–560 (2003)

3. Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model finding. In: Proc. CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications (2003)

4. Marques-Silva, J., Lynce, I., Malik, S.: 4. In: Conflict-Driven Clause Learning SAT Solvers. Frontiers in Artificial Intel. and Applications, vol. 185, pp. 131–153. IOS Press (February 2009)

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

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

1. Assessing Progress in SAT Solvers Through the Lens of Incremental SAT;Theory and Applications of Satisfiability Testing – SAT 2021;2021

2. SAT-Based Encodings for Optimal Decision Trees with Explicit Paths;Theory and Applications of Satisfiability Testing – SAT 2020;2020

3. Speeding Up Assumption-Based SAT;Lecture Notes in Computer Science;2019

4. QBF as an Alternative to Courcelle’s Theorem;Theory and Applications of Satisfiability Testing – SAT 2018;2018

5. Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories;Automated Reasoning;2018