Abstraction-Based Algorithm for 2QBF-Reference-Cited by-同舟云学术

Abstraction-Based Algorithm for 2QBF

Published:2011 Issue: Volume: Page:230-244
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing - SAT 2011
language:
Short-container-title:

Author:

Janota Mikoláš,Marques-Silva Joao

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21581-0_19

Reference40 articles.

1. Lecture Notes in Computer Science;C.W. Barrett,2002

2. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

3. Browning, B., Remshagen, A.: A SAT-based solver for Q-ALL SAT. In: Menezes, R. (ed.) ACM Southeast Regional Conference, pp. 30–33. ACM, New York (2006)

4. Castellini, C., Giunchiglia, E., Tacchella, A.: Improvements to SAT-based conformant planning. In: European Conference on Planning (2001)

5. Lecture Notes in Computer Science;P. Chauhan,2002

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

1. Algorithms for partially robust team formation;Autonomous Agents and Multi-Agent Systems;2023-04-25

2. Logic-Based Explainability in Machine Learning;Reasoning Web. Causality, Explanations and Declarative Knowledge;2023

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

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

5. Signal Selection Methods for Debugging Gate-Level Sequential Circuits;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-12-01