int pc_get_snode_feature_3(void) {
int idx = bpx_get_integer(bpx_get_call_arg(1,3));
double val = switch_instances[idx]->inside_h;
double lambda = switch_instances[idx]->inside;
return bpx_unify(bpx_get_call_arg(2,3),bpx_build_float(val))
&& bpx_unify(bpx_get_call_arg(3,3),bpx_build_float(lambda));
}
int pc_prism_vt_4(void)
{
struct VT_Engine vt_eng;
RET_ON_ERR(check_smooth(&vt_eng.smooth));
RET_ON_ERR(run_vt(&vt_eng));
return
bpx_unify(bpx_get_call_arg(1,4), bpx_build_integer(vt_eng.iterate )) &&
bpx_unify(bpx_get_call_arg(2,4), bpx_build_float (vt_eng.lambda )) &&
bpx_unify(bpx_get_call_arg(3,4), bpx_build_float (vt_eng.likelihood)) &&
bpx_unify(bpx_get_call_arg(4,4), bpx_build_integer(vt_eng.smooth )) ;
}
int pc_prism_em_6(void)
{
struct EM_Engine em_eng;
RET_ON_ERR(check_smooth(&em_eng.smooth));
RET_ON_ERR(run_em(&em_eng));
release_num_sw_vals();
return
bpx_unify(bpx_get_call_arg(1,6), bpx_build_integer(em_eng.iterate )) &&
bpx_unify(bpx_get_call_arg(2,6), bpx_build_float (em_eng.lambda )) &&
bpx_unify(bpx_get_call_arg(3,6), bpx_build_float (em_eng.likelihood)) &&
bpx_unify(bpx_get_call_arg(4,6), bpx_build_float (em_eng.bic )) &&
bpx_unify(bpx_get_call_arg(5,6), bpx_build_float (em_eng.cs )) &&
bpx_unify(bpx_get_call_arg(6,6), bpx_build_integer(em_eng.smooth )) ;
}
int pc_compute_inside_2(void)
{
int gid;
double prob;
EG_NODE_PTR eg_ptr;
gid = bpx_get_integer(bpx_get_call_arg(1,2));
initialize_egraph_index();
alloc_sorted_egraph(1);
RET_ON_ERR(sort_one_egraph(gid, 0, 1));
if (verb_graph) {
print_egraph(0, PRINT_NEUTRAL);
}
eg_ptr = expl_graph[gid];
if (log_scale) {
RET_ON_ERR(compute_inside_scaling_log_exp());
prob = eg_ptr->inside;
}
else {
RET_ON_ERR(compute_inside_scaling_none());
prob = eg_ptr->inside;
}
return bpx_unify(bpx_get_call_arg(2,2), bpx_build_float(prob));
}
/* [Note] node copying is not required here even in computation without
* inter-goal sharing, but we need to declare it explicitly.
*/
int pc_compute_viterbi_5(void)
{
TERM p_goal_path,p_subpath_goal,p_subpath_sw;
int goal_id;
double viterbi_prob;
goal_id = bpx_get_integer(bpx_get_call_arg(1,5));
initialize_egraph_index();
alloc_sorted_egraph(1);
/* INIT_MIN_MAX_NODE_NOS; */
RET_ON_ERR(sort_one_egraph(goal_id,0,1));
if (verb_graph) print_egraph(0,PRINT_NEUTRAL);
compute_max();
if (debug_level) print_egraph(1,PRINT_VITERBI);
get_most_likely_path(goal_id,&p_goal_path,&p_subpath_goal,
&p_subpath_sw,&viterbi_prob);
return
bpx_unify(bpx_get_call_arg(2,5), p_goal_path) &&
bpx_unify(bpx_get_call_arg(3,5), p_subpath_goal) &&
bpx_unify(bpx_get_call_arg(4,5), p_subpath_sw) &&
bpx_unify(bpx_get_call_arg(5,5), bpx_build_float(viterbi_prob));
}
int pc_get_snode_inside_2(void)
{
int idx = bpx_get_integer(bpx_get_call_arg(1,2));
double val = switch_instances[idx]->inside;
if (log_scale) val = log(val);
return bpx_unify(bpx_get_call_arg(2,2),bpx_build_float(val));
}
int pc_prism_grd_2(void) {
struct CRF_Engine crf_eng;
RET_ON_ERR(run_grd(&crf_eng));
return
bpx_unify(bpx_get_call_arg(1,2), bpx_build_integer(crf_eng.iterate)) &&
bpx_unify(bpx_get_call_arg(2,2), bpx_build_float(crf_eng.likelihood));
}
int pc_prism_vbvt_2(void)
{
struct VBVT_Engine vbvt_eng;
RET_ON_ERR(check_smooth_vb());
RET_ON_ERR(run_vbvt(&vbvt_eng));
return
bpx_unify(bpx_get_call_arg(1,2), bpx_build_integer(vbvt_eng.iterate)) &&
bpx_unify(bpx_get_call_arg(2,2), bpx_build_float(vbvt_eng.free_energy));
}
int pc_prism_vbem_2(void)
{
struct VBEM_Engine vb_eng;
RET_ON_ERR(check_smooth_vb());
RET_ON_ERR(run_vbem(&vb_eng));
release_num_sw_vals();
return
bpx_unify(bpx_get_call_arg(1,2), bpx_build_integer(vb_eng.iterate)) &&
bpx_unify(bpx_get_call_arg(2,2), bpx_build_float(vb_eng.free_energy));
}
int pc_import_graph_stats_4(void)
{
int stats[4];
double avg_shared;
graph_stats(stats);
avg_shared = (double)(stats[3]) / stats[0];
return
bpx_unify(bpx_get_call_arg(1,4), bpx_build_integer(stats[0])) &&
bpx_unify(bpx_get_call_arg(2,4), bpx_build_integer(stats[1])) &&
bpx_unify(bpx_get_call_arg(3,4), bpx_build_integer(stats[2])) &&
bpx_unify(bpx_get_call_arg(4,4), bpx_build_float(avg_shared));
}
int pc_import_occ_switches_3(void)
{
CACHE_REGS
TERM p_sw_list,p_sw_list0,p_sw_list1;
TERM p_sw_ins_list0,p_sw_ins_list1,sw,sw_ins;
TERM p_num_sw, p_num_sw_ins;
int i;
int num_sw_ins;
void release_occ_switches();
#ifdef __YAP_PROLOG__
TERM *hstart;
restart:
hstart = heap_top;
#endif
p_sw_list = bpx_get_call_arg(1,3);
p_num_sw = bpx_get_call_arg(2,3);
p_num_sw_ins = bpx_get_call_arg(3,3);
p_sw_list0 = bpx_build_nil();
num_sw_ins = 0;
for (i = 0; i < occ_switch_tab_size; i++) {
SW_INS_PTR ptr;
#ifdef __YAP_PROLOG__
if ( heap_top + 64*1024 >= local_top ) {
H = hstart;
/* running out of stack */
extern int Yap_gcl(UInt gc_lim, Int predarity, CELL *current_env, yamop *nextop);
Yap_gcl(4*64*1024, 3, ENV, CP);
goto restart;
}
#endif
sw = bpx_build_structure("sw",2);
bpx_unify(bpx_get_arg(1,sw), bpx_build_integer(i));
p_sw_ins_list0 = bpx_build_nil();
ptr = occ_switches[i];
while (ptr != NULL) {
num_sw_ins++;
if (ptr->inside <= 0.0) ptr->inside = 0.0; /* FIXME: quick hack */
sw_ins = bpx_build_structure("sw_ins",4);
bpx_unify(bpx_get_arg(1,sw_ins),bpx_build_integer(ptr->id));
bpx_unify(bpx_get_arg(2,sw_ins),bpx_build_float(ptr->inside));
bpx_unify(bpx_get_arg(3,sw_ins),bpx_build_float(ptr->smooth));
bpx_unify(bpx_get_arg(4,sw_ins),bpx_build_float(ptr->total_expect));
p_sw_ins_list1 = bpx_build_list();
bpx_unify(bpx_get_car(p_sw_ins_list1),sw_ins);
bpx_unify(bpx_get_cdr(p_sw_ins_list1),p_sw_ins_list0);
p_sw_ins_list0 = p_sw_ins_list1;
ptr = ptr->next;
}
bpx_unify(bpx_get_arg(2,sw),p_sw_ins_list0);
p_sw_list1 = bpx_build_list();
bpx_unify(bpx_get_car(p_sw_list1),sw);
bpx_unify(bpx_get_cdr(p_sw_list1),p_sw_list0);
p_sw_list0 = p_sw_list1;
}
release_occ_switches();
return
bpx_unify(p_sw_list, p_sw_list0) &&
bpx_unify(p_num_sw, bpx_build_integer(occ_switch_tab_size)) &&
bpx_unify(p_num_sw_ins, bpx_build_integer(num_sw_ins));
}
int pc_get_snode_expectation_2(void)
{
int idx = bpx_get_integer(bpx_get_call_arg(1,2));
return bpx_unify(bpx_get_call_arg(2,2),
bpx_build_float(switch_instances[idx]->total_expect));
}
int pc_get_gnode_viterbi_2(void)
{
int idx = bpx_get_integer(bpx_get_call_arg(1,2));
return bpx_unify(bpx_get_call_arg(2,2),
bpx_build_float(expl_graph[idx]->max));
}
static void get_n_most_likely_path_rerank(int n, int l, int goal_id,
TERM *p_n_viterbi_list_ptr)
{
TERM p_goal_path;
TERM p_subpath_goal, p_subpath_sw;
TERM p_tmp, p_tmp_g, p_tmp_g0, p_tmp_g1, p_tmp_sw, p_tmp_sw0, p_tmp_sw1;
TERM p_n_viterbi, p_n_viterbi_list, p_tmp_list;
TERM p_viterbi_prob;
int j,m,k;
EG_PATH_PTR path_ptr = NULL;
int c_len, sw_len;
V_ENT_PTR v_ent;
int l_used;
double n_viterbi_egraph_score;
p_n_viterbi_list = bpx_build_list();
p_tmp_list = p_n_viterbi_list;
l_used = 0;
for (j = 0; j < l; j++) {
if (expl_graph[goal_id]->top_n[j] != NULL) l_used++;
}
viterbi_rank =
(V_RANK_PTR)MALLOC(sizeof(struct ViterbiRankEntry) * l_used);
for (j = 0; j < l_used; j++) {
alloc_n_viterbi_egraphs();
n_viterbi_egraph_size =
visit_n_most_likely_path(expl_graph[goal_id]->top_n[j],0);
viterbi_rank[j].size = n_viterbi_egraph_size;
viterbi_rank[j].expl = n_viterbi_egraphs;
viterbi_rank[j].score = compute_rerank_score();
}
qsort(viterbi_rank, l_used, sizeof(struct ViterbiRankEntry),
compare_viterbi_rank);
for (j = 0; j < l_used && j < n; j++) {
n_viterbi_egraph_size = viterbi_rank[j].size;
n_viterbi_egraphs = viterbi_rank[j].expl;
n_viterbi_egraph_score = viterbi_rank[j].score;
/* Build the Viterbi path as a Prolog list: */
p_goal_path = bpx_build_list();
p_tmp = p_goal_path;
for (m = 0; m < n_viterbi_egraph_size; m++) {
bpx_unify(bpx_get_car(p_tmp),
bpx_build_integer(n_viterbi_egraphs[m]->goal_id));
if (m == n_viterbi_egraph_size - 1) {
bpx_unify(bpx_get_cdr(p_tmp),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp),bpx_build_list());
p_tmp = bpx_get_cdr(p_tmp);
}
}
p_subpath_goal = bpx_build_list();
p_subpath_sw = bpx_build_list();
p_tmp_g = p_subpath_goal;
p_tmp_sw = p_subpath_sw;
for (m = 0; m < n_viterbi_egraph_size; m++) {
v_ent = n_viterbi_egraphs[m];
if (v_ent->path_ptr == NULL) {
p_tmp_g0 = bpx_build_nil();
p_tmp_sw0 = bpx_build_nil();
}
else {
path_ptr = v_ent->path_ptr;
c_len = path_ptr->children_len;
sw_len = path_ptr->sws_len;
if (c_len == 0) {
p_tmp_g0 = bpx_build_nil();
}
else {
p_tmp_g0 = bpx_build_list();
p_tmp_g1 = p_tmp_g0;
for (k = 0; k < c_len; k++) {
bpx_unify(bpx_get_car(p_tmp_g1),
bpx_build_integer(path_ptr->children[k]->id));
if (k == c_len - 1) {
bpx_unify(bpx_get_cdr(p_tmp_g1),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_g1),bpx_build_list());
p_tmp_g1 = bpx_get_cdr(p_tmp_g1);
}
}
}
if (sw_len == 0) {
p_tmp_sw0 = bpx_build_nil();
}
else {
p_tmp_sw0 = bpx_build_list();
p_tmp_sw1 = p_tmp_sw0;
for (k = 0; k < sw_len; k++) {
bpx_unify(bpx_get_car(p_tmp_sw1),bpx_build_integer(path_ptr->sws[k]->id));
if (k == sw_len - 1) {
bpx_unify(bpx_get_cdr(p_tmp_sw1),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_sw1),bpx_build_list());
p_tmp_sw1 = bpx_get_cdr(p_tmp_sw1);
}
}
}
}
bpx_unify(bpx_get_car(p_tmp_g),p_tmp_g0);
bpx_unify(bpx_get_car(p_tmp_sw),p_tmp_sw0);
if (m == n_viterbi_egraph_size - 1) {
bpx_unify(bpx_get_cdr(p_tmp_g),bpx_build_nil());
bpx_unify(bpx_get_cdr(p_tmp_sw),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_g),bpx_build_list());
bpx_unify(bpx_get_cdr(p_tmp_sw),bpx_build_list());
p_tmp_g = bpx_get_cdr(p_tmp_g);
p_tmp_sw = bpx_get_cdr(p_tmp_sw);
}
}
p_viterbi_prob = bpx_build_float(n_viterbi_egraph_score);
p_n_viterbi = bpx_build_structure("v_expl",5);
bpx_unify(bpx_get_arg(1,p_n_viterbi),bpx_build_integer(j));
bpx_unify(bpx_get_arg(2,p_n_viterbi),p_goal_path);
bpx_unify(bpx_get_arg(3,p_n_viterbi),p_subpath_goal);
bpx_unify(bpx_get_arg(4,p_n_viterbi),p_subpath_sw);
bpx_unify(bpx_get_arg(5,p_n_viterbi),p_viterbi_prob);
bpx_unify(bpx_get_car(p_tmp_list),p_n_viterbi);
if (j == (l_used - 1) || j == (n - 1)) {
bpx_unify(bpx_get_cdr(p_tmp_list),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_list),bpx_build_list());
p_tmp_list = bpx_get_cdr(p_tmp_list);
}
}
for (j = 0; j < l_used; j++) {
free(viterbi_rank[j].expl);
}
free(viterbi_rank);
viterbi_rank = NULL;
*p_n_viterbi_list_ptr = p_n_viterbi_list;
}
static void get_n_most_likely_path(int n, int goal_id,
TERM *p_n_viterbi_list_ptr)
{
TERM p_goal_path;
TERM p_subpath_goal, p_subpath_sw;
TERM p_tmp, p_tmp_g, p_tmp_g0, p_tmp_g1, p_tmp_sw, p_tmp_sw0, p_tmp_sw1;
TERM p_n_viterbi, p_n_viterbi_list, p_tmp_list;
TERM p_viterbi_prob;
int j,m,k;
EG_PATH_PTR path_ptr = NULL;
int c_len, sw_len;
V_ENT_PTR v_ent;
p_n_viterbi_list = bpx_build_list();
p_tmp_list = p_n_viterbi_list;
for (j = 0; j < n; j++) {
if (expl_graph[goal_id]->top_n[j] == NULL) continue;
alloc_n_viterbi_egraphs();
n_viterbi_egraph_size =
visit_n_most_likely_path(expl_graph[goal_id]->top_n[j],0);
/* Build the Viterbi path as a Prolog list: */
p_goal_path = bpx_build_list();
p_tmp = p_goal_path;
for (m = 0; m < n_viterbi_egraph_size; m++) {
bpx_unify(bpx_get_car(p_tmp),bpx_build_integer(n_viterbi_egraphs[m]->goal_id));
if (m == n_viterbi_egraph_size - 1) {
bpx_unify(bpx_get_cdr(p_tmp),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp),bpx_build_list());
p_tmp = bpx_get_cdr(p_tmp);
}
}
p_subpath_goal = bpx_build_list();
p_subpath_sw = bpx_build_list();
p_tmp_g = p_subpath_goal;
p_tmp_sw = p_subpath_sw;
for (m = 0; m < n_viterbi_egraph_size; m++) {
v_ent = n_viterbi_egraphs[m];
if (v_ent->path_ptr == NULL) {
p_tmp_g0 = bpx_build_nil();
p_tmp_sw0 = bpx_build_nil();
}
else {
path_ptr = v_ent->path_ptr;
c_len = path_ptr->children_len;
sw_len = path_ptr->sws_len;
if (c_len == 0) {
p_tmp_g0 = bpx_build_nil();
}
else {
p_tmp_g0 = bpx_build_list();
p_tmp_g1 = p_tmp_g0;
for (k = 0; k < c_len; k++) {
bpx_unify(bpx_get_car(p_tmp_g1),bpx_build_integer(path_ptr->children[k]->id));
if (k == c_len - 1) {
bpx_unify(bpx_get_cdr(p_tmp_g1),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_g1),bpx_build_list());
p_tmp_g1 = bpx_get_cdr(p_tmp_g1);
}
}
}
if (sw_len == 0) {
p_tmp_sw0 = bpx_build_nil();
}
else {
p_tmp_sw0 = bpx_build_list();
p_tmp_sw1 = p_tmp_sw0;
for (k = 0; k < sw_len; k++) {
bpx_unify(bpx_get_car(p_tmp_sw1),bpx_build_integer(path_ptr->sws[k]->id));
if (k == sw_len - 1) {
bpx_unify(bpx_get_cdr(p_tmp_sw1),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_sw1),bpx_build_list());
p_tmp_sw1 = bpx_get_cdr(p_tmp_sw1);
}
}
}
}
bpx_unify(bpx_get_car(p_tmp_g),p_tmp_g0);
bpx_unify(bpx_get_car(p_tmp_sw),p_tmp_sw0);
if (m == n_viterbi_egraph_size - 1) {
bpx_unify(bpx_get_cdr(p_tmp_g),bpx_build_nil());
bpx_unify(bpx_get_cdr(p_tmp_sw),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_g),bpx_build_list());
bpx_unify(bpx_get_cdr(p_tmp_sw),bpx_build_list());
p_tmp_g = bpx_get_cdr(p_tmp_g);
p_tmp_sw = bpx_get_cdr(p_tmp_sw);
}
}
p_viterbi_prob = bpx_build_float(expl_graph[goal_id]->top_n[j]->max);
p_n_viterbi = bpx_build_structure("v_expl",5);
bpx_unify(bpx_get_arg(1,p_n_viterbi),bpx_build_integer(j));
bpx_unify(bpx_get_arg(2,p_n_viterbi),p_goal_path);
bpx_unify(bpx_get_arg(3,p_n_viterbi),p_subpath_goal);
bpx_unify(bpx_get_arg(4,p_n_viterbi),p_subpath_sw);
bpx_unify(bpx_get_arg(5,p_n_viterbi),p_viterbi_prob);
bpx_unify(bpx_get_car(p_tmp_list),p_n_viterbi);
if (j == n - 1 ||
(j < n - 1 && expl_graph[goal_id]->top_n[j + 1] == NULL)) {
bpx_unify(bpx_get_cdr(p_tmp_list),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(p_tmp_list),bpx_build_list());
p_tmp_list = bpx_get_cdr(p_tmp_list);
}
for (m = 0; m < n_viterbi_egraph_size; m++) {
/* Release the entries newly added in visit_n_most_likely_path() */
if (n_viterbi_egraphs[m]->path_ptr == NULL) {
free(n_viterbi_egraphs[m]);
}
}
free(n_viterbi_egraphs);
n_viterbi_egraphs = NULL;
}
*p_n_viterbi_list_ptr = p_n_viterbi_list;
}
int pc_compute_hindsight_4(void)
{
TERM p_subgoal,p_hindsight_pairs,t,t1,p_pair;
int goal_id,is_cond,j;
goal_id = bpx_get_integer(bpx_get_call_arg(1,4));
p_subgoal = bpx_get_call_arg(2,4);
is_cond = bpx_get_integer(bpx_get_call_arg(3,4));
initialize_egraph_index();
alloc_sorted_egraph(1);
RET_ON_ERR(sort_one_egraph(goal_id,0,1));
if (verb_graph) print_egraph(0,PRINT_NEUTRAL);
alloc_hindsight_goals();
if (log_scale) {
RET_ON_ERR(compute_inside_scaling_log_exp());
RET_ON_ERR(compute_outside_scaling_log_exp());
RET_ON_ERR(get_hindsight_goals_scaling_log_exp(p_subgoal,is_cond));
}
else {
RET_ON_ERR(compute_inside_scaling_none());
RET_ON_ERR(compute_outside_scaling_none());
RET_ON_ERR(get_hindsight_goals_scaling_none(p_subgoal,is_cond));
}
if (hindsight_goal_size > 0) {
/* Build the list of pairs of a subgoal and its hindsight probability */
p_hindsight_pairs = bpx_build_list();
t = p_hindsight_pairs;
for (j = 0; j < hindsight_goal_size; j++) {
p_pair = bpx_build_list();
t1 = p_pair;
bpx_unify(bpx_get_car(t1),
bpx_build_integer(hindsight_goals[j]));
bpx_unify(bpx_get_cdr(t1),bpx_build_list());
t1 = bpx_get_cdr(t1);
bpx_unify(bpx_get_car(t1),bpx_build_float(hindsight_probs[j]));
bpx_unify(bpx_get_cdr(t1),bpx_build_nil());
bpx_unify(bpx_get_car(t),p_pair);
if (j == hindsight_goal_size - 1) {
bpx_unify(bpx_get_cdr(t),bpx_build_nil());
}
else {
bpx_unify(bpx_get_cdr(t),bpx_build_list());
t = bpx_get_cdr(t);
}
}
}
else {
p_hindsight_pairs = bpx_build_nil();
}
FREE(hindsight_goals);
FREE(hindsight_probs);
return bpx_unify(bpx_get_call_arg(4,4),p_hindsight_pairs);
}