QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving-Reference-Cited by-同舟云学术

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

Published:2015 Issue: Volume: Page:343-359
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Tu Kuan-Hua,Hsu Tzu-Chien,Jiang Jie-Hong R.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-24318-4_25

Reference25 articles.

1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Benedetti,2005

2. Lecture Notes in Computer Science;A Biere,2011

3. Beyersdorff, O., Chew, L., Janota, M.: Proof complexity of resolution-base QBF calculi. In: Proc. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 76–89 (2015)

4. Balabanov, V., Jiang, J.-H.R.: Unified QBF Certification and its Applications. Formal Methods in System Design 41(1), 45–65 (2012)

5. Lecture Notes in Computer Science;V Balabanov,2014

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

1. Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations;Formal Methods in System Design;2021-08

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

3. Homing Sequence Derivation with Quantified Boolean Satisfiability;IEEE Transactions on Computers;2021

4. The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17);Artificial Intelligence;2019-09

5. Expansion-based QBF Solving on Tree Decompositions*;Fundamenta Informaticae;2019-06-01