Resolution Proofs and Skolem Functions in QBF Evaluation and Applications-Reference-Cited by-同舟云学术

Resolution Proofs and Skolem Functions in QBF Evaluation and Applications

Published:2011 Issue: Volume: Page:149-164
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Balabanov Valeriy,Jiang Jie-Hong R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22110-1_12

Reference21 articles.

1. Lecture Notes in Artificial Intelligence;M. Benedetti,2005

2. Benedetti, M.: Extracting Certificates from Quantified Boolean Formulas. In: Proc. Int.Joint Conf. on Artificial Intelligence (IJCAI) (2005)

3. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic Hardware Synthesis from Specifications: A Case Study. In: Proc. Design Automation and Test in Europe (2007)

4. Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification, http://www.eecs.berkeley.edu/~alanmi/abc/

5. Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. Journal of Automated Reasoning 28(2), 101–142 (2002)

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

1. Counterexample Guided Knowledge Compilation for Boolean Functional Synthesis;Computer Aided Verification;2023

2. Functional synthesis via input–output separation;Formal Methods in System Design;2022-04

3. A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

4. Chapter 31. Quantified Boolean Formulas;Frontiers in Artificial Intelligence and Applications;2021-02-02

5. How QBF Expansion Makes Strategy Extraction Hard;Automated Reasoning;2020