2012-03-22 21:36:44 +00:00
|
|
|
|
|
|
|
|
:- module(trie_sp, [trie_to_bdd/3,
|
|
|
|
|
tabled_trie_to_bdd/3]).
|
|
|
|
|
|
|
|
|
|
:- use_module((bdd)).
|
|
|
|
|
:- use_module(library(tries)).
|
|
|
|
|
:- use_module(library(rbtrees)).
|
|
|
|
|
|
|
|
|
|
trie_to_bdd(Trie, BDD, MapList) :-
|
|
|
|
|
trie_to_list(Trie, Complex),
|
|
|
|
|
rb_new(Map0),
|
|
|
|
|
complex_to_andor(Complex,Map0,Map,Tree),
|
|
|
|
|
rb_visit(Map, MapList),
|
|
|
|
|
extract_vars(MapList, Vs),
|
2012-04-26 13:52:09 +01:00
|
|
|
bdd_new(Tree, Vs, BDD).
|
2012-03-22 21:36:44 +00:00
|
|
|
|
|
|
|
|
tabled_trie_to_bdd(Trie, BDD, MapList) :-
|
|
|
|
|
trie_to_list(Trie, Complex),
|
|
|
|
|
rb_new(Map0),
|
|
|
|
|
rb_new(Tab0),
|
|
|
|
|
Complex = [list(Els)],
|
|
|
|
|
tabled_complex_to_andor(Els,Map0,Map,Tab0,_Tab,Tree),
|
|
|
|
|
rb_visit(Map, MapList),
|
|
|
|
|
extract_vars(MapList, Vs),
|
|
|
|
|
bdd_new(Tree, Vs, BDD),
|
|
|
|
|
bdd_tree(BDD, bdd(_, L, _)), length(L,Len), writeln(Len).
|
|
|
|
|
|
|
|
|
|
extract_vars([], []).
|
|
|
|
|
extract_vars((_-V).MapList, V.Vs) :-
|
|
|
|
|
extract_vars(MapList, Vs).
|
|
|
|
|
|
2012-05-17 09:56:49 +01:00
|
|
|
complex_to_andor(empty, Map, Map, 0).
|
2012-03-22 21:36:44 +00:00
|
|
|
complex_to_andor([list(Els)], Map0, MapF, Tree) :- !,
|
|
|
|
|
complex_to_andor(Els, Map0, MapF, Tree).
|
|
|
|
|
complex_to_andor([El1,El2|Els], Map0, MapF, or(T1,T2)) :- !,
|
|
|
|
|
complex_to_and(El1, Map0, MapI, T1),
|
|
|
|
|
complex_to_andor(El2.Els, MapI, MapF, T2).
|
|
|
|
|
complex_to_andor([Els], Map0, MapF, V) :-
|
|
|
|
|
complex_to_and(Els, Map0, MapF, V).
|
|
|
|
|
|
|
|
|
|
complex_to_and(int(A1,[endlist]), Map0, MapF, V) :- !,
|
|
|
|
|
check(Map0, A1, V, MapF).
|
|
|
|
|
complex_to_and(functor(not,1,[int(A1,[endlist])]), Map0, MapF, not(V)) :- !,
|
|
|
|
|
check(Map0, A1, V, MapF).
|
|
|
|
|
complex_to_and(int(A1,Els), Map0, MapF, and(V,T2)) :-
|
|
|
|
|
check(Map0, A1, V, MapI),
|
|
|
|
|
complex_to_andor(Els, MapI, MapF, T2).
|
|
|
|
|
complex_to_and(functor(not,1,[int(A1,Els)]), Map0, MapF, and(not(V),T2)) :-
|
|
|
|
|
check(Map0, A1, V, MapI),
|
|
|
|
|
complex_to_andor(Els, MapI, MapF, T2).
|
|
|
|
|
|
|
|
|
|
tabled_complex_to_andor(T, Map, Map, Tab, Tab, V) :-
|
|
|
|
|
rb_lookup(T, V, Tab), !,
|
|
|
|
|
increment_ref_count(V).
|
|
|
|
|
tabled_complex_to_andor(IN, Map0, MapF, Tab0, TabF, OUT) :-
|
|
|
|
|
IN = [El1,El2|Els], !,
|
|
|
|
|
OUT = or(0,_,T1,T2),
|
|
|
|
|
rb_insert(Tab0, IN, OUT, Tab1),
|
|
|
|
|
tabled_complex_to_and(El1, Map0, MapI, Tab1, TabI, T1),
|
|
|
|
|
tabled_complex_to_andor(El2.Els, MapI, MapF, TabI, TabF, T2).
|
|
|
|
|
tabled_complex_to_andor([Els], Map0, MapF, Tab0, TabF, V) :-
|
|
|
|
|
tabled_complex_to_and(Els, Map0, MapF, Tab0, TabF, V).
|
|
|
|
|
|
|
|
|
|
tabled_complex_to_and(int(A1,[endlist]), Map0, MapF, Tab, Tab, V) :- !,
|
|
|
|
|
check(Map0, A1, V, MapF).
|
|
|
|
|
tabled_complex_to_and(functor(not,1,[int(A1,[endlist])]), Map0, MapF, Tab, Tab, not(V)) :- !,
|
|
|
|
|
check(Map0, A1, V, MapF).
|
|
|
|
|
tabled_complex_to_and(T, Map, Map, Tab, Tab, V) :-
|
|
|
|
|
rb_lookup(T, V, Tab), !,
|
|
|
|
|
increment_ref_count(V).
|
|
|
|
|
tabled_complex_to_and(IN, Map0, MapF, Tab0, TabF, OUT) :-
|
|
|
|
|
IN = int(A1,Els), !,
|
|
|
|
|
check(Map0, A1, V, MapI),
|
|
|
|
|
rb_insert(Tab0, IN, OUT, TabI),
|
|
|
|
|
OUT = and(0, _, V, T2),
|
|
|
|
|
tabled_complex_to_andor(Els, MapI, MapF, TabI, TabF, T2).
|
|
|
|
|
tabled_complex_to_and(IN, Map0, MapF, Tab0, TabF, OUT) :-
|
|
|
|
|
IN = functor(not,1,[int(A1,Els)]), !,
|
|
|
|
|
check(Map0, A1, V, MapI),
|
|
|
|
|
rb_insert(Tab0, IN, OUT, TabI),
|
|
|
|
|
OUT = and(0, _, not(V), T2),
|
|
|
|
|
tabled_complex_to_andor(Els, MapI, MapF, TabI, TabF, T2).
|
|
|
|
|
|
|
|
|
|
check(M0, K, V, M) :- rb_lookup(K, V, M0), !, M = M0.
|
|
|
|
|
check(M0, K, V, M) :- rb_insert(M0, K, V, M).
|
|
|
|
|
|
|
|
|
|
increment_ref_count(V) :-
|
|
|
|
|
arg(1,V,I0),
|
|
|
|
|
I is I0+1,
|
|
|
|
|
setarg(1,V,I).
|
|
|
|
|
|
|
|
|
|
|
