An implementation of DataLog using BDD data structures (devel list)

Alan Ryan | 21 Nov 2007 13:58

Variable Ordering

Hi John,

I am having trouble getting the solver to run the machine learning algorithm. I have taken a trivial app and run:

[alan <at> soma-dt resources]$ java -cp $CLASSPATH:resources/:. -Xmx1024m -Dpa.dumppath=results/ -Dpa.specialmapinfo=yes -Dpa.dumpunmunged=yes -Dpa.signaturesinlocs=yes joeq.Main.GenRelations Driver

This produces the relations as expected. I then want to take pacs2.datalog supplied in bddbdb_examples and run it.   I comment out the .bddnodes & .bddcache & .bddvarorder directives (same error if I don't do this) in pacs2.datalog and then run:

[alan <at> soma-dt resources]$ java -cp $CLASSPATH:resources/:. -Xmx1024m -Dpa.dumppath=results/ -Dfindbestorder -Dfbotrials=700 -Dbddnodes=100000 -Dbddvarorder= net.sf.bddbddb.Solver pacs2.datalog

This gives me:
(the entire output is attached, libbuddy.so is not loading for me, I get an 'unsatisifed link error : addRef' when I put in the directory I am executing from. I haven't tried to solve this.)

Exception in thread "main" java.lang.NullPointerException
        at net.sf.bddbddb.order.TrialDataRepository.buildAttribInstances(TrialDataRepository.java:79)
        at net.sf.bddbddb.order.TrialDataRepository.getAttribDataGroup (TrialDataRepository.java:153)
        at net.sf.bddbddb.FindBestDomainOrder.tryNewGoodOrder(FindBestDomainOrder.java:777)
        at net.sf.bddbddb.FindBestDomainOrder.hasOrdersToTry(FindBestDomainOrder.java:602)
        at net.sf.bddbddb.FindBestDomainOrder.findBestDomainOrder(FindBestDomainOrder.java:2065)
        at net.sf.bddbddb.BDDInferenceRule.evalRelations(BDDInferenceRule.java:480)
        at net.sf.bddbddb.BDDInferenceRule.update (BDDInferenceRule.java:373)
        at net.sf.bddbddb.ir.BDDInterpreter.interpret(BDDInterpreter.java:70)
        at net.sf.bddbddb.ir.BDDInterpreter.interpret(BDDInterpreter.java:50)
        at net.sf.bddbddb.BDDSolver.solve (BDDSolver.java:395)
        at net.sf.bddbddb.Solver.run(Solver.java:388)
        at net.sf.bddbddb.Solver.main2(Solver.java:441)
        at net.sf.bddbddb.Solver.main(Solver.java:1108)

What am I doing wrong here - I cannot seem to get the results that Luke was getting in his email regarding the same?

Thanks,
Alan

--
T: +353 91 512601

Dept. of Information Technology.
National University of Ireland, Galway

[alan <at> soma-dt resources]$ java -cp $CLASSPATH:resources/:.  -Xmx1024m -Dpa.dumppath=results/
-Dfindbestorder -Dfbotrials=700 -Dbddnodes=100000 -Dbddvarorder= net.sf.bddbddb.Solver pacs2.datalog

Initializing BDD library (100000 nodes, cache size 25000, min free 0.2%)
Could not load BDD package buddy: Can't load library: /home/alan/phd/bddbddb/resources/libbuddy.so
Using BDD library JFactory 474
Opening Datalog program "pacs2.datalog"
WARNING: Cannot load mapfile "results/class.map", skipping.
12 field domains.
26 relations.
13 rules.
Splitting rules: done.
Initializing solver: Garbage collection #1: 1009 nodes / 107 free / 0.0030s / 0.0030s total
Resizing node table from 1009 to 2017
Adding missing domain "V0" to bddvarorder.
Adding missing domain "V1" to bddvarorder.
Adding missing domain "I0" to bddvarorder.
Adding missing domain "I1" to bddvarorder.
Adding missing domain "H0" to bddvarorder.
Adding missing domain "H1" to bddvarorder.
Adding missing domain "Z0" to bddvarorder.
Adding missing domain "F0" to bddvarorder.
Adding missing domain "T0" to bddvarorder.
Adding missing domain "T1" to bddvarorder.
Adding missing domain "N0" to bddvarorder.
Adding missing domain "M0" to bddvarorder.
Adding missing domain "C0" to bddvarorder.
Adding missing domain "M1" to bddvarorder.
Adding missing domain "STR0" to bddvarorder.
Adding missing domain "VC0" to bddvarorder.
Adding missing domain "VC1" to bddvarorder.
Setting variable ordering to VC1_VC0_STR0_C0_M1_M0_N0_T1_T0_F0_Z0_H1_H0_I1_I0_V1_V0_, Start reordering
Garbage collection #2: 2017 nodes / 1067 free / 0.0010s / 0.0040s total
End reordering. Went from 976 to 950 nodes, gain = 2% (0.072 sec)
done.
194,193,192,191,190,189,188,187,186,185,184,183,182,181,180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,140,139,138,137,136,135,134,133,132,131,130,129,150,149,148,147,146,145,144,143,142,141,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1,0,
Resizing node table from 2017 to 99991
Trials filename=trials_pacs2.xml
done.
Loading initial relations: Loading BDD from file: vP0.bdd 4897 nodes, 1468.0 elements.
Loading BDD from file: A.bdd 1187 nodes, 849.0 elements.
Loading BDD from file: S.bdd 4780 nodes, 644.0 elements.
Loading BDD from file: L.bdd 2272 nodes, 135.0 elements.
Loading BDD from file: actual.bdd 6899 nodes, 1881.0 elements.
Loading BDD from file: formal.bdd 4471 nodes, 612.0 elements.
Loading BDD from file: Mret.bdd 983 nodes, 146.0 elements.
Loading BDD from file: Mthr.bdd 3073 nodes, 1230.0 elements.
Loading BDD from file: Iret.bdd 2790 nodes, 407.0 elements.
Loading BDD from file: Ithr.bdd 5122 nodes, 1154.0 elements.
Loading BDD from file: mI.bdd Garbage collection #3: 99991 nodes / 62967 free / 0.0070s / 0.011s total
9282 nodes, 1154.0 elements.
Loading BDD from file: IE0.bdd 4060 nodes, 1127.0 elements.
Loading BDD from file: vT.bdd Garbage collection #4: 99991 nodes / 55576 free / 0.0080s / 0.019s total
3728 nodes, 3623.0 elements.
Loading BDD from file: hT.bdd 1269 nodes, 974.0 elements.
Loading BDD from file: aT.bdd 779 nodes, 746.0 elements.
Loading BDD from file: cha.bdd 2289 nodes, 617.0 elements.
Loading BDD from file: hP0.bdd WARNING: Cannot load bdd hP0: java.io.FileNotFoundException:
results/hP0.bdd (No such file or directory)
Loading BDD from file: roots.bdd 14 nodes, 45.0 elements.
done. (337 ms)
Stratifying: 
Note: the following relations are unused:
    [cha, hP0]
Note: the following rules are unused:
Discovering stratum, 0 SCCs visited so far
Finished discovery of 52 SCCs in 1 strata
done. (33 ms)
Solving: 
list1:
  list2:
    cvP(_,v:V0,h:H0) :- vP0(v:V0,h:H0).
    mI0(m:M0,i:I0) :- mI(m:M0,i:I0,_:N0).
    cA(_,v1:V0,_,v2:V1) :- A(v1:V0,v2:V1).
    vPfilter(v:V0,h:H0) :- vT(v:V0,tv:T0), aT(tv:T0,th:T1), hT(h:H0,th:T1).
    IEnum(i,m,vc2,vc1) :- roots(m), mI0(m,i), IE0(i,m).
    IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0) :- IE0(i:I0,m:M0), IEnum(i:I0,m:M0,vc2:VC1,vc1:VC0).
    IE(i:I0,m:M0) :- IEcs(_:VC1,i:I0,_:VC0,m:M0).
    cA(vc2:VC1,v2:V0,vc1:VC0,v1:V1) :- Mthr(m:M0,v1:V1), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0), Ithr(i:I0,v2:V0).
    cA(vc2:VC1,v2:V0,vc1:VC0,v1:V1) :- Mret(m:M0,v1:V1), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0), Iret(i:I0,v2:V0).
    cA(vc1:VC0,v1:V0,vc2:VC1,v2:V1) :- formal(m:M0,z:Z0,v1:V0), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0), actual(i:I0,z:Z0,v2:V1).
    loop3:
      loop5:
        cvP(vc1:VC0,v1:V0,h:H0) :- cA(vc1:VC0,v1:V0,vc2:VC1,v2:V1), cvP(vc2:VC1,v2:V1,h:H0), vPfilter(v1:V0,h:H0).
      cvP_11_0(f:F0,v2:V1,vc1:VC0,h1:H0) :- L(v1:V0,f:F0,v2:V1), cvP(vc1:VC0,v1:V0,h1:H0).
      hP(h1:H0,f:F0,h2:H1) :- S(v1:V0,f:F0,v2:V1), cvP(vc1:VC0,v1:V0,h1:H0), cvP(vc1:VC0,v2:V1,h2:H1).
      cvP_11_1(v2:V1,vc1:VC0,h2:H1) :- cvP_11_0(f:F0,v2:V1,vc1:VC0,h1:H0), hP(h1:H0,f:F0,h2:H1).
      cvP(vc1:VC0,v2:V1,h2:H1) :- cvP_11_1(v2:V1,vc1:VC0,h2:H1), vPfilter(v2:V1,h2:H1).

Applying inference rule:
   cvP(_,v:V0,h:H0) :- vP0(v:V0,h:H0). (1)
Applying inference rule:
   mI0(m:M0,i:I0) :- mI(m:M0,i:I0,_:N0). (1)
Applying inference rule:
   cA(_,v1:V0,_,v2:V1) :- A(v1:V0,v2:V1). (1)
Applying inference rule:
   vPfilter(v:V0,h:H0) :- vT(v:V0,tv:T0), aT(tv:T0,th:T1), hT(h:H0,th:T1). (1)
Applying numbering rule:
   IEnum(i,m,vc2,vc1) :- roots(m), mI0(m,i), IE0(i,m).
Garbage collection #5: 99991 nodes / 41935 free / 0.01s / 0.029s total
Done counting paths (1242 ms, number of paths = 13196 (14 bits)          
Garbage collection #6: 99991 nodes / 4844 free / 0.013s / 0.042s total
Resizing node table from 99991 to 299969
Garbage collection #7: 299969 nodes / 192110 free / 0.023s / 0.065s total
Garbage collection #8: 299969 nodes / 186936 free / 0.024s / 0.089s total
Garbage collection #9: 299969 nodes / 185060 free / 0.024s / 0.113s total
Garbage collection #10: 299969 nodes / 185412 free / 0.024s / 0.137s total
Garbage collection #11: 299969 nodes / 180906 free / 0.025s / 0.162s total
Garbage collection #12: 299969 nodes / 148282 free / 0.03s / 0.192s total
Garbage collection #13: 299969 nodes / 165578 free / 0.027s / 0.219s total
Garbage collection #14: 299969 nodes / 140328 free / 0.03s / 0.249s total
Garbage collection #15: 299969 nodes / 127969 free / 0.032s / 0.281s total
Garbage collection #16: 299969 nodes / 155750 free / 0.029s / 0.31s total
Garbage collection #17: 299969 nodes / 142863 free / 0.031s / 0.341s total
Garbage collection #18: 299969 nodes / 141777 free / 0.031s / 0.372s total
Garbage collection #19: 299969 nodes / 143517 free / 0.031s / 0.403s total
Garbage collection #20: 299969 nodes / 131401 free / 0.032s / 0.435s total
Garbage collection #21: 299969 nodes / 150505 free / 0.029s / 0.464s total
Garbage collection #22: 299969 nodes / 144100 free / 0.031s / 0.495s total
Garbage collection #23: 299969 nodes / 139500 free / 0.031s / 0.526s total
Garbage collection #24: 299969 nodes / 141132 free / 0.031s / 0.557s total
Garbage collection #25: 299969 nodes / 141454 free / 0.031s / 0.588s total
Garbage collection #26: 299969 nodes / 130849 free / 0.032s / 0.62s total
Garbage collection #27: 299969 nodes / 136797 free / 0.031s / 0.651s total
Garbage collection #28: 299969 nodes / 147632 free / 0.031s / 0.682s total
Garbage collection #29: 299969 nodes / 124670 free / 0.037s / 0.719s total
Garbage collection #30: 299969 nodes / 143531 free / 0.031s / 0.75s total
Garbage collection #31: 299969 nodes / 136378 free / 0.032s / 0.782s total
Garbage collection #32: 299969 nodes / 107594 free / 0.036s / 0.818s total
Garbage collection #33: 299969 nodes / 110455 free / 0.035s / 0.853s total
Garbage collection #34: 299969 nodes / 97496 free / 0.038s / 0.891s total
Garbage collection #35: 299969 nodes / 115436 free / 0.035s / 0.926s total
Garbage collection #36: 299969 nodes / 96907 free / 0.038s / 0.964s total
Garbage collection #37: 299969 nodes / 104030 free / 0.037s / 1.001s total
Garbage collection #38: 299969 nodes / 118924 free / 0.035s / 1.036s total
Garbage collection #39: 299969 nodes / 118029 free / 0.035s / 1.071s total
Garbage collection #40: 299969 nodes / 112190 free / 0.036s / 1.107s total
Garbage collection #41: 299969 nodes / 106630 free / 0.037s / 1.144s total
Garbage collection #42: 299969 nodes / 115519 free / 0.035s / 1.179s total
Garbage collection #43: 299969 nodes / 107672 free / 0.037s / 1.216s total
Garbage collection #44: 299969 nodes / 115517 free / 0.035s / 1.251s total
Garbage collection #45: 299969 nodes / 119436 free / 0.035s / 1.286s total
Time spent: 15517 ms
Applying inference rule:
   IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0) :- IE0(i:I0,m:M0), IEnum(i:I0,m:M0,vc2:VC1,vc1:VC0). (1)
Applying inference rule:
   IE(i:I0,m:M0) :- IEcs(_:VC1,i:I0,_:VC0,m:M0). (1)
Garbage collection #46: 299969 nodes / 120095 free / 0.035s / 1.321s total
Applying inference rule:
   cA(vc2:VC1,v2:V0,vc1:VC0,v1:V1) :- Mthr(m:M0,v1:V1), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0),
Ithr(i:I0,v2:V0). (1)
Garbage collection #47: 299969 nodes / 83603 free / 0.04s / 1.361s total
Garbage collection #48: 299969 nodes / 65480 free / 0.042s / 1.403s total
Garbage collection #49: 299969 nodes / 50922 free / 0.045s / 1.448s total
Resizing node table from 299969 to 899903
Applying inference rule:
   cA(vc2:VC1,v2:V0,vc1:VC0,v1:V1) :- Mret(m:M0,v1:V1), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0),
Iret(i:I0,v2:V0). (1)
Applying inference rule:
   cA(vc1:VC0,v1:V0,vc2:VC1,v2:V1) :- formal(m:M0,z:Z0,v1:V0), IEcs(vc2:VC1,i:I0,vc1:VC0,m:M0),
actual(i:I0,z:Z0,v2:V1). (1)
Garbage collection #50: 899903 nodes / 475464 free / 0.093s / 1.541s total
Variables: [vc2, vc1, m, z, i, v2, v1]
Exception in thread "main" java.lang.NullPointerException
        at net.sf.bddbddb.order.TrialDataRepository.buildAttribInstances(TrialDataRepository.java:79)
        at net.sf.bddbddb.order.TrialDataRepository.getAttribDataGroup(TrialDataRepository.java:153)
        at net.sf.bddbddb.FindBestDomainOrder.tryNewGoodOrder(FindBestDomainOrder.java:777)
        at net.sf.bddbddb.FindBestDomainOrder.hasOrdersToTry(FindBestDomainOrder.java:602)
        at net.sf.bddbddb.FindBestDomainOrder.findBestDomainOrder(FindBestDomainOrder.java:2065)
        at net.sf.bddbddb.BDDInferenceRule.evalRelations(BDDInferenceRule.java:480)
        at net.sf.bddbddb.BDDInferenceRule.update(BDDInferenceRule.java:373)
        at net.sf.bddbddb.ir.BDDInterpreter.interpret(BDDInterpreter.java:70)
        at net.sf.bddbddb.ir.BDDInterpreter.interpret(BDDInterpreter.java:50)
        at net.sf.bddbddb.BDDSolver.solve(BDDSolver.java:395)
        at net.sf.bddbddb.Solver.run(Solver.java:388)
        at net.sf.bddbddb.Solver.main2(Solver.java:441)
        at net.sf.bddbddb.Solver.main(Solver.java:1108)

-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2005.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/

_______________________________________________
bddbddb-devel mailing list
bddbddb-devel <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/bddbddb-devel