论文信息 - The QBFEVAL Web Portal

The QBFEVAL Web Portal

In this paper we describe the QBFEVAL web portal, an on-line resource supporting the participants and the organizers of the yearly evaluation of QBF solvers and instances.

Luca Pulina | Armando Tacchella | Massimo Narizzano

[1] David A. Basin,et al. Bounded Model Construction for Monadic Second-Order Logics , 2000, CAV.

[2] Moshe Y. Vardi,et al. Optimizing a BDD-Based Modal Solver , 2003, CADE.

[3] Philippe Chatalic,et al. SatEx: A Web-based Framework for SAT Experimentation , 2001, Electron. Notes Discret. Math..

[4] Karem A. Sakallah,et al. Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.

[5] Jussi Rintanen,et al. Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[6] Armando Tacchella,et al. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..

[7] Matthew MacDonald,et al. Web Services Architecture , 2004 .

[8] Sharad Malik,et al. Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems , 2004, SAT.

[9] Bernd Becker,et al. Checking equivalence for partial implementations , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[10] Laurent Simon,et al. Preface to the Special Volume on the SAT 2005 Competitions and Evaluations , 2006, J. Satisf. Boolean Model. Comput..

[11] Luca Pulina,et al. Report of the Third QBF Solvers Evaluation , 2006, J. Satisf. Boolean Model. Comput..

[12] Ian P. Gent,et al. Encoding Connect-4 using Quantified Boolean Formulae , 2003 .