The Quantified Boolean Formulas Satisfiability Library
Home
Instances
Solvers
QBF Evaluations
Application domain Miscellanea
Description:
Number of families:
67
Families:
(D)-QBF_Autarkies (
50
)
Abduction (
303
)
amba (
8
)
arithmetic (
10
)
ASP_Equivalence_Checking (
250
)
ASP_Program_Inclusion (
200
)
Balabanov_dqbf (
34
)
Bloem_dqbf (
8
)
BoundedSynthesisPetriGames (
360
)
Chain (
12
)
chess_composing (
58
)
chess_solving (
127
)
CombinationalEquivalence (
50
)
crafted_2020 (
132
)
cycle-sched (
10
)
disjunctive_decomposition (
10
)
driver (
10
)
formula_add (
12
)
genbuf (
11
)
genpatch (
5
)
gttt-4x4_2020 (
96
)
gttt-5x5-iterative-deepening_2020 (
20
)
hex-hein_2020 (
23
)
hwmcc (
14
)
hyperLTL (
2
)
Impl (
10
)
k_branch_n (
21
)
k_branch_p (
21
)
k_d4_n (
21
)
k_d4_p (
21
)
k_dum_n (
21
)
k_dum_p (
21
)
k_grz_n (
21
)
k_grz_p (
21
)
k_lin_n (
21
)
k_lin_p (
21
)
k_path_n (
21
)
k_path_p (
21
)
k_ph_n (
21
)
k_ph_p (
21
)
k_poly_n (
21
)
k_poly_p (
21
)
k_t4p_n (
21
)
k_t4p_p (
21
)
ltl2aig-comp (
12
)
LTL2DBA (
6
)
LTL2DPA (
4
)
mqm (
136
)
mult-matrix (
12
)
PetriGames (
25
)
PositionalGames_gttt (
64
)
PositionalGames_hex (
49
)
QBF-Hardness (
198
)
Qshifter (
6
)
Random-qcir-1000-50 (
1000
)
Reduction-finding (
4620
)
Reduction-finding-qcir (
2296
)
Rewriting (
10
)
SAT (
21
)
Scholl_dqbf (
25
)
Selection-hard (
10
)
sketch (
14
)
Tentrup_dqbf (
27
)
toy (
11
)
Tree (
14
)
UNSAT (
21
)
wgrowing (
42
)
Results:
Contact
|
Organization
|
Links
|
Citing QBFLIB
