Blocks World Planning Domain

More details about this benchmark can be found in the web page: BENCHMARK PROBLEMS FOR ANSWER SET PROGRAMMING SYSTEMS.



Table -bw.1: Having Answer Sets.

problem steps atoms rules Smodels DLV ASSAT(mchaff) ASSAT(Satz) ASSAT(Sato) ASSAT(zchaff)
bw.15 8 7058 81681 16.62 26.04 7.15 12.08 6.81 7.54
bw.17 9 9902 127999 32.06 44.59 10.79 20.13 10.23 11.51
bw.19 10 13422 191621 57.93 150.44 15.59 32.63 14.76 16.15
bw.20 10 14786 221004 43.35 --- 20.65 33.57 16.82 18.47
bw.21 11 17690 276387 71.86 --- 22.76 49.89 21.15 23.44
bw.22 12 20932 341184 --- 632.81 29.01 74.03 26.51 27.76
bw.23 12 22778 386521 2284.19 890.51 31.48 76.29 29.5 31.55
bw.24 13 26602 469352 781.65 689.64 37.92 101.23 37.15 37.65
bw.25 14 30812 564385 --- 2613.85 49.34 153.66 44.04 46.51
bw.26 14 33212 630560 --- 596.22 52.82 153.3 48.47 51.12
bw.27 15 38082 748639 2754.53 4165.76 65.06 --- 57.91 59.45
bw.28 16 43386 882068 --- --- 72.8 --- 68.89 72.13
bw.29 16 46412 974613 --- 1795.72 81.31 --- 77.32 81.63
bw.30 17 52454 1136712 --- --- 94.18 --- 89.53 91.22
bw.31 18 58978 1317669 --- --- 112.38 --- 110.52 105.66
bw.32 18 62702 1442764 --- 4681.02 117.84 --- 114.84 117.65

The logic programs in Table-bw.1 correspond to computing the optimal plans for those planning problems. The numbers given in steps are the shortest steps for the planning problems.



Table -bw.2: Having No Answer Set.

problem steps atoms rules Smodels DLV ASSAT(mchaff) ASSAT(Satz) ASSAT(Sato) ASSAT(zchaff)
bw.15 7 6274 72527 7.14 15.73 6.42 8.59 5.69 6.16
bw.17 8 8912 115109 11.9 42.64 9.54 14.49 8.46 9.37
bw.19 9 12202 174099 17.58 7206 13.69 22.3 12.33 13.56
bw.20 9 13442 200800 20.05 86.34 15.31 25.27 13.94 15.28
bw.21 10 16216 253241 24.95 236.1 19.47 33.25 17.5 19.27
bw.22 11 19322 314824 32.49 769.73 23.9 45.7 22.56 23.74
bw.23 11 21026 356663 36.62 621.33 27 50.81 24.58 26.48
bw.24 12 24702 435700 45.07 1857.38 32.36 67.19 29.84 32
bw.25 13 28758 526631 57.47 1899.95 40.62 90.07 36.31 39.25
bw.26 13 30998 588384 63.91 2049.18 44.35 101.16 40.6 43.33
bw.27 14 35702 701709 78.16 2674.23 52.11 49.99 48.68 51.84
bw.28 15 40834 830040 97.58 3674.03 62.27 60.29 59.21 63.19
bw.29 15 43682 917131 107.67 3007.77 68.53 --- 65.63 68.92
bw.30 16 49540 1073408 128.12 6610.29 81.71 --- 74.7 79.51
bw.31 17 55874 1248163 156.8 --- 100.63 --- 87.48 94.29
bw.32 17 59402 1366664 172.12 --- 106.87 --- 96.86 101.85

The logic programs in Table-bw.2 correspond to verifying that there is no plan with steps shorter than the optimal plans. The numbers given in steps are ones immediately before the shortest steps.



bw.lp( Own to Niemela 1999).

bw.n means that this problem has n blocks. In particular, bw.15, bw.17, bw.19 are the same as bw-large.c, bw-large.d, and bw-large.e repectively in reference to Smodels.

Yuting Zhao
Last modified: Saturday January 3 2003