Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm-Reference-Cited by-同舟云学术

Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm

Published:2011 Issue: Volume: Page:178-185
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Zhang Jianmin,Xu Weixia,Zhang Jun,Shen Shengyu,Pang Zhengbin,Li Tiejun,Xia Jun,Li Sikun

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-23878-9_22

Reference18 articles.

1. Jorg, H., Ri, B.: Conformant planning via heuristic forward search: A new approach. Artificial Intelligence 170, 507–541 (2006)

2. Jain, H., Kroening, D.: Word level predicate abstraction and refinement for verifying RTL Verilog. In: Proceedings of the 42nd Design Automation Conference (DAC 2005), pp. 445–450 (2005)

3. Simmonds, J., et al.: Exploiting resolution proofs to speed up LTL vacuity detection for BMC. In: Proceedings of the 7th International Conference on Formal Methods in Computer Aided Design (FMCAD 2007), pp. 3–12 (2007)

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

5. Lynce, I., Marques-Silva, J.P.: On computing minimum unsatisfiable cores. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 305–310. Springer, Heidelberg (2004)

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

1. Semantic Relevance;Automated Reasoning;2022

2. Summarization of Boolean satisfiability verification;Journal of Electronics (China);2014-06