Skip to main content
SpringerLink
Log in

The QBFEVAL Web Portal

  • Conference paper
Logics in Artificial Intelligence (JELIA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4160))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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: http://jsat.ewi.tudelft.nl/

    MATH  Google Scholar 

  2. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org

  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. 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. Sutcliffe, G., Suttner, C.: The tptp problem library for automated theorem proving (2006-6-19), Available from: http://www.cs.miami.edu/~tptp/

  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. Le Berre, D., Simon, L.: The SAT Competition (2006-6-2), http://www.satcompetition.org

Download references

Author information

Authors and Affiliations

  1. Laboratory of Systems and Technologies for Automated Reasoning (STAR-Lab), DIST, Università di Genova, Viale Causa, 13, 16145, Genova, Italy

    Massimo Narizzano, Luca Pulina & Armando Tacchella

Authors
  1. Massimo Narizzano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Pulina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Armando Tacchella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, U.K.

    Michael Fisher

  2. University of Liverpool, United Kingdom

    Wiebe van der Hoek

  3. University of Liverpool, Liverpool, UK

    Boris Konev

  4. Department of Computer Science, The University of Liverpool,  

    Alexei Lisitsa

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narizzano, M., Pulina, L., Tacchella, A. (2006). The QBFEVAL Web Portal. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds) Logics in Artificial Intelligence. JELIA 2006. Lecture Notes in Computer Science(), vol 4160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853886_45

Download citation

  • DOI: https://doi.org/10.1007/11853886_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39625-3

  • Online ISBN: 978-3-540-39627-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation