Le code source n'est pas encore disponible. En revanche, il est toujours possible
de réaliser des tests à l'aide des premières versions de qbfl :
Il est possible d'obtenir les renseignements suivants (et d'autres) sur le site
consacré aux QBFs :
Author
|
|
C. Scholl
and B. Becker
|
CEfPI,
description
|
Checking Equivalence for Partial Implementation problems (true and false)
|
|
Guoqiang Pan
|
MLK
|
Translated formulas from modal logic K. The source
benchmark is F. Massaci's TANCS 2000 easy portion. See the
author's CADE-19 paper for details
|
|
M. Narizzano
|
|
A. Ayari
|
|
C. Castellini
|
Toilet A
|
bomb in the toilet, with flushing and indeterminism (all true)
|
Toilet A
|
bomb in the toilet, with flushing and indeterminism (all false)
|
Toilet C
|
bomb in the toilet, with flushing but without indeterminism (all true)
|
Toilet C
|
bomb in the toilet, with flushing but without indeterminism (all false)
|
Toilet G
|
bomb in the toilet, without flushing and indeterminism (all true)
|
All
|
all Castellini's benchmarks (true and false)
|
|
R. Letz
|
True Instances
|
a small set of true instances which are hard for tree-based QBF procedures
|
False Instances
|
a small set of false instances which are hard for tree-based QBF procedures
|
All
|
all Letz's benchmarks (true and false)
|
|
J. Rintanen
|
Blocks world
|
planning problems in the blocks world
(all true)
|
Blocks world
|
planning problems in the blocks world
(all false)
|
Chain
|
planning problems (all true)
|
Impl
|
a chain of implications (all true)
|
Logn
|
instances of conditional planning (all false)
|
R3cnf
|
(all true)
|
R3cnf
|
(all false)
|
Toilet
|
bomb in the toilet planning problems
(all true)
|
Toilet
|
bomb in the toilet planning problems
(all false)
|
All
|
all Rintanen's benchmarks (true and false)
|
|
M. Narizzano
|
Robot Problems, description
d = 2
s = 1 ,
s = 2 ,
s = 3 ,
s = 4 ,
s = 5 ,
s = 6 ,
s = 7 ,
s = 8 ,
s = 9 ,
s = 10
|
all true and false instances
|
|
|
d = 3
s = 1 ,
s = 2 ,
s = 3 ,
s = 4 ,
s = 5 ,
s = 6 ,
s = 7 ,
s = 8 ,
s = 9 ,
s = 10
|
all true and false instances
|
|
|
d = 4
s = 1 ,
s = 2 ,
s = 3 ,
s = 4 ,
s = 5 ,
s = 6 ,
s = 7 ,
s = 8 ,
s = 9 ,
s = 10
|
all true and false instances
|
|
|
d = 5
s = 1 ,
s = 2 ,
s = 3 ,
s = 4 ,
s = 5 ,
s = 6 ,
s = 7 ,
s = 8 ,
s = 9 ,
s = 10
|
all true and false instances
|
|