Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers-Reference-Cited by-同舟云学术

Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers

Published:2002 Issue: Volume: Page:187-201
ISSN:0302-9743
Container-title:Formal Methods in Computer-Aided Design
language:
Short-container-title:

Author:

Ayari Abdelwaheb,Basin David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36126-X_12

Reference22 articles.

1. Lect Notes Comput Sci;A. Ayari,2000

2. Abdelwaheb Ayari, David Basin, and Stefan Friedrich. Structural and behavioral modeling with monadic logics. In Rolf Drechsler and Bernd Becker, editors, The Twenty-Ninth IEEE International Symposium on Multiple-Valued Logic. IEEE Computer Society, Los Alamitos, Freiburg, Germany, May 1999.

3. Lect Notes Comput Sci;A. Biere,1999

4. Thierry Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14(4), October 1992.

5. Hans Kleine Büning and Theodor Lettmann. Aussagenlogik: Deduktion und Algorithmen. B. G. Teubner, Stuttgart, 1994.

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

1. Never Trust Your Solver: Certification for SAT and QBF;Lecture Notes in Computer Science;2023

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

3. Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness;Theory and Applications of Satisfiability Testing – SAT 2020;2020

4. Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications;Theory and Applications of Satisfiability Testing – SAT 2018;2018

5. Evaluating QBF Solvers: Quantifier Alternations Matter;Lecture Notes in Computer Science;2018