The QBFEVAL web portal

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4160 LNAI, Issue , 2006, Pages 494-497

  Narizzano, Massimo ^a   Pulina, Luca ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; ONLINE SEARCHING; PROBLEM SOLVING; SOCIETIES AND INSTITUTIONS;

ONLINE RESOURCES; ORGANIZERS; QBF SOLVERS; QBFEVAL;

PORTALS;

EID: 33750057987     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11853886_45     Document Type: Conference Paper

References (7)

1. M. Narizzano, L. Pulina, and A. Tacchella. 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/ [2006-6-2].
2. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formulas satisfiability library (QBFLIB), 2001. www.qbflib.org.
3. W. W. Eckerson. Three Tier Client/Server Architecture: Achieving Scalability, Performance, and Efficiency in Client Server Applications. Open Information Systems, 3, 1995.
4. D. Booth, H. Haas, F. McCabe, E. Newcomer, M. Champion, C. Ferris, and D. Orchard. Web Services Architecture, February 2004. W3C Working Group Note.
5. G. Sutcliffe and C. Suttner. The tptp problem library for automated theorem proving. Available from http://www.cs.miami.edu/~tptp/ [2006-6-19].
6. L. Simon and P. Chatalic. SATEx: a Web-based Framework for SAT Experimentation. In Workshop on Theory and Applications of Satisfiability Testing, 2001.
7. D. Le Berre and L. Simon. The SAT Competition. http://www.satcompetition. org [2006-6-2].