org.hops.dm.app
Class update

java.lang.Object
  org.hops.dm.app.update

public class update
extends java.lang.Object

updates the information state with the last integration moves actualizes the agenda

Version:

3.0

Author:

Meritxell Gonzalez

Field Summary

dbcall

database database access

Constructor Summary

update(IS is)
creates a new instance of update

Method Summary

protected void	load_plan() recover_plan findPlan if plan loaded ==> neteja comm?
protected boolean	remove_Findout() Not executing Q if its question is already shared rule remove_Findout class exec_plan pre fst(private/plan,findout(Q)) in(shared/com,P) Domain :: resolves(P,Q) eff pop(private/plan)
void	update_algorithm(utterance actualut, stackact next_moves) update algorithm.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

database

public dbcall database

database access

Constructor Detail

update

public update(IS is)

creates a new instance of update

Parameters:

is - the information state reference

Method Detail

update_algorithm

public void update_algorithm(utterance actualut,
                             stackact next_moves)

update algorithm. getLatestMoves, try backupSharedUsr, try irrelevantFollowUp, ADDED(not in IBIS) try downdate_nim repeat repeat (integrate, try downdate_issues try remove_Findout, try load_plan), orelse apply shift(private/nim) until fully_shifted(PRIVATE/NIM), // loop for cycling through all non-integrated moves and try to integrate them // if integration succeds, the algorithm tries to remove any resolved issues from ISSUES and PLAN, and if necessary LOAD a new plan. // Then it tries integration again. // IF integration fails, the NIM queue is shifted one step and integrations is tried again. // this continues until the queue has been completely cycled through once and all moves have had a shot at being integrated. apply shift(/private/nim), try select_action accommodate until it fails // first try to integrate as many moves as possible by cycling through the NIM queue. // then, if accommodation can be applied, do the same thing again. // repeat this until nothing can be integrated and no accommodation is possible repeat exec_plan until it fails, // until no more execution is possible at the current stage of the dialogue try downdate_qud

load_plan

protected void load_plan()

recover_plan findPlan if plan loaded ==> neteja comm?

remove_Findout

protected boolean remove_Findout()

Not executing Q if its question is already shared rule remove_Findout class exec_plan pre fst(private/plan,findout(Q)) in(shared/com,P) Domain :: resolves(P,Q) eff pop(private/plan)