Circuit-Based Search Space Pruning in QBF-Reference-Cited by-同舟云学术

Circuit-Based Search Space Pruning in QBF

Published:2018 Issue: Volume: Page:187-198
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2018
language:
Short-container-title:

Author:

Janota Mikoláš

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94144-8_12

Reference29 articles.

1. Ansótegui, C., Gomes, C.P., Selman, B.: The Achilles’ heel of QBF. In: National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI), pp. 275–281 (2005)

2. Lecture Notes in Computer Science;V Balabanov,2016

3. Benedetti, M., Mangassarian, H.: QBF-based formal verification: experience and perspectives. J. Satisfiability Bool. Model. Comput. (JSAT) 5(1–4), 133–191 (2008)

4. Bjørner, N., Janota, M.: Playing with quantified satisfaction. In: International Conferences on Logic for Programming LPAR-20, Short Presentations, vol. 35, pp. 15–27. EasyChair (2015)

5. CQESTO website. http://sat.inesc-id.pt/~mikolas/sw/cqesto/res.html

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

1. Implicit QBF Encodings for Positional Games;Lecture Notes in Computer Science;2024

2. Quantifier Shifting for Quantified Boolean Formulas Revisited;Lecture Notes in Computer Science;2024

3. Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification;Lecture Notes in Computer Science;2022

4. QCTL model-checking with QBF solvers;Information and Computation;2021-10

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