%0 Journal Article
%T A Plan Recognition Algorithm Based on Plan Knowledge Graph<br>一种基于规划知识图的规划识别算法
%A JIANG Yun-fei
%A MA Ning
%A <br>姜云飞
%A 马宁
%J 软件学报
%D 2002
%I 
%X A new plan formalism method and a plan knowledge graph concept. Compared with Kautz s formalism used widely in plan recognition, this method is simpler and more direct. Because a concept of supporting degree is introduced into plan knowledge graph, the recognized plans are changed reasonably as new evidences collected. A plan recognition algorithm based on knowledge graph presented in this paper can change the plan recognition problem into the graph searching one. This method not only prompts efficiency but also gives the same result as Kautz's.
%K plan recognition
%K event
%K temporal constraint<br>规划识别
%K 事件
%K 时序约束
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=FA902C285D0D8B6E&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=E158A972A605785F&sid=710C005323C0774A&eid=15F713CDE16A589C&journal_id=1000-9825&journal_name=软件学报&referenced_num=16&reference_num=8