Flexibility and Optimization of QBF Skolem–Herbrand Certificates
暂无分享,去创建一个
[1] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.
[2] Daniel Kroening,et al. A First Step Towards a Unified Proof Checker for QBF , 2007, SAT.
[3] Jie-Hong Roland Jiang,et al. Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..
[4] Nachum Dershowitz,et al. Bounded Model Checking with QBF , 2005, SAT.
[5] Fahiem Bacchus,et al. A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas , 2011, IJCAI.
[6] Jie-Hong Roland Jiang,et al. Interpolating functions from large Boolean relations , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.
[7] Fahiem Bacchus,et al. Beyond CNF: A Circuit-Based QBF Solver , 2009, SAT.
[8] Luca Pulina,et al. Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers , 2009, IJCAI.
[9] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[10] Robert K. Brayton,et al. DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.
[11] Ieee Circuits,et al. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[12] Mikolás Janota,et al. Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs , 2015, AAAI.
[13] Jie-Hong Roland Jiang,et al. QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving , 2015, SAT.
[14] Mikolás Janota,et al. Solving QBF with Counterexample Guided Refinement , 2012, SAT.
[15] Marco Benedetti. Extracting Certificates from Quantified Boolean Formulas , 2005, IJCAI.
[16] Roderick Bloem,et al. Fault Localization and Correction with QBF , 2007, SAT.
[17] Jie-Hong Roland Jiang,et al. QBF Resolution Systems and Their Proof Complexities , 2014, SAT.
[18] Marco Benedetti,et al. Evaluating QBFs via Symbolic Skolemization , 2005, LPAR.
[19] Armin Biere,et al. Resolution-Based Certificate Extraction for QBF - (Tool Presentation) , 2012, SAT.
[20] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[21] Armin Biere,et al. DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..
[22] Jie-Hong Roland Jiang,et al. BooM: A decision procedure for boolean matching with abstraction and dynamic learning , 2010, Design Automation Conference.
[23] S. Malik,et al. Validating the result of a quantified Boolean formula (QBF) solver: theory and practice , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..
[24] Hans Kleine Büning,et al. Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..
[25] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[26] Jussi Rintanen,et al. Asymptotically Optimal Encodings of Conformant Planning in QBF , 2007, AAAI.
[27] Luca Pulina,et al. Evaluating and certifying QBFs: A comparison of state-of-the-art tools , 2009, AI Commun..
[28] Jie-Hong Roland Jiang,et al. Resolution Proofs and Skolem Functions in QBF Evaluation and Applications , 2011, CAV.
[29] Florian Lonsing,et al. Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving , 2013, LPAR.