Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers

Published:2009-09 Issue: Volume:251 Page:83-95
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Lonsing Florian,Biere Armin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference26 articles.

1. The Transitive Reduction of a Directed Graph;Aho;SIAM J. Comput.,1972

2. QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers;Ayari,2002

3. Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19–23, 2005, Proceedings,2005

4. Benedetti, M., Quantifier Trees for QBFs, in: Bacchus and Walsh [3], pp. 378–385

5. sKizzo: A Suite to Evaluate and Certify QBFs;Benedetti,2005

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

1. Dependency Schemes for DQBF;Theory and Applications of Satisfiability Testing – SAT 2016;2016

2. Preprocessing for DQBF;Lecture Notes in Computer Science;2015

3. The Seventh QBF Solvers Evaluation (QBFEVAL’10);Theory and Applications of Satisfiability Testing – SAT 2010;2010

4. A Compact Representation for Syntactic Dependencies in QBFs;Lecture Notes in Computer Science;2009

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP