Solving QBF with counterexample guided refinement-Reference-Cited by-同舟云学术

Solving QBF with counterexample guided refinement

Author:

Janota Mikoláš^ORCID,Klieber William,Marques-Silva Joao,Clarke Edmund

Funder

SFI

CMU-Portugal

FCT

PIDDAC

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference71 articles.

1. H. Kleine Büning, U. Bubeck, Theory of quantified Boolean formulas, in: [71], 2009, pp. 735–760.

2. QBF-based formal verification: experience and perspectives;Benedetti;J. Satisf. Boolean Model. Comput.,2008

3. Asymptotically optimal encodings of conformant planning in QBF;Rintanen,2007

4. Completeness in the polynomial-time hierarchy: a compendium;Schaefer;SIGACT News,2002

5. E. Giunchiglia, P. Marin, M. Narizzano, Reasoning with quantified Boolean formulas, in: [71], 2009, pp. 761–780.

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

1. Towards Uniform Certification in QBF;Logical Methods in Computer Science;2024-02-13

2. DSLUT: An Asymmetric LUT and its Automatic Design Flow Based on Practical Functions;2023 International Conference on Field Programmable Technology (ICFPT);2023-12-12

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

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