Efficient Combination of Decision Procedures for MUS Computation-Reference-Cited by-同舟云学术

Efficient Combination of Decision Procedures for MUS Computation

Published:2009 Issue: Volume: Page:335-349
ISSN:0302-9743
Container-title:Frontiers of Combining Systems
language:
Short-container-title:

Author:

Piette Cédric,Hamadi Youssef,Saïs Lakhdar

Publisher

Springer Berlin Heidelberg

Link

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

Reference20 articles.

1. Lecture Notes in Computer Science;K.L. McMillan,2003

2. Gupta, A., Ganai, M., Yang, Z., Ashar, P.: Iterative abstraction using SAT-based BMC with proof analysis. In: Proceedings of the IEEE/ACM international conference on Computer-aided design (ICCAD 2003), Washington, DC, USA, pp. 416–423 (2003)

3. Lecture Notes in Computer Science;R.E. Bryant,2007

4. Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: DAC 2004: Proceedings of the 41st annual conference on Design automation, pp. 518–523. ACM Press, New York (2004)

5. Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Sixth international conference on theory and applications of satisfiability testing (SAT 2003), Portofino, Italy (2003)

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

1. Algorithms for computing minimal equivalent subformulas;Artificial Intelligence;2014-11

2. On Computing Minimal Equivalent Subformulas;Lecture Notes in Computer Science;2012

3. Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm;Lecture Notes in Computer Science;2011

4. Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper);2010 40th IEEE International Symposium on Multiple-Valued Logic;2010