The QBFEVAL Web Portal

  • Massimo Narizzano
  • Luca Pulina
  • Armando Tacchella
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4160)


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.


Automate Reasoning Boolean Formula Open Information System Unsolved Instance Provide User Interface 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Narizzano, M., Pulina, L., Tacchella, A.: The third QBF solvers comparative evaluation. Journal on Satisfiability, Boolean Modeling and Computation 2, 145–164 (2006), Available on-line at: MATHGoogle Scholar
  2. 2.
    Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001),
  3. 3.
    Eckerson, W.W.: Three Tier Client/Server Architecture: Achieving Scalability, Performance, and Efficiency in Client Server Applications. Open Information Systems 3 (1995)Google Scholar
  4. 4.
    Booth, D., Haas, H., McCabe, F., Newcomer, E., Champion, M., Ferris, C., Orchard, D.: Web Services Architecture. W3C Working Group Note (February 2004)Google Scholar
  5. 5.
    Sutcliffe, G., Suttner, C.: The tptp problem library for automated theorem proving (2006-6-19), Available from:
  6. 6.
    Simon, L., Chatalic, P.: SATEx: a Web-based Framework for SAT Experimentation. In: Workshop on Theory and Applications of Satisfiability Testing (2001)Google Scholar
  7. 7.
    Le Berre, D., Simon, L.: The SAT Competition (2006-6-2),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Massimo Narizzano
    • 1
  • Luca Pulina
    • 1
  • Armando Tacchella
    • 1
  1. 1.Laboratory of Systems and Technologies for Automated Reasoning (STAR-Lab), DISTUniversità di GenovaGenovaItaly

Personalised recommendations