%0 Journal Article
%T The Research of Constraint Satisfaction Problems Encoding of Planning Problems<br>规划问题编码为约束可满足问题的研究
%A WU Li-Hua
%A CHEN Ai-Yang
%A JIANG Yun-Fei
%A <br>伍丽华
%A 陈蔼洋
%A 姜云飞
%J 计算机科学
%D 2006
%I 
%X The planning solution based on constraint satisfaction problem(CSP) is one of the most important methods of researching intelligent planning. Encoding planning problems into CSPs play a major role in planning solving. In this paper, we focus on the encoding of planning problems into CSP and describe some existing satisfiability procedures that have been used extensively for planning, and the discussion of the application problem about domain knowledge in encoding approach is presented.
%K CSP
%K SAT<br>规划问题
%K 领域知识
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=55D8BA126BB71BC1&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=5D311CA918CA9A03&sid=3E0812ED84A7B31D&eid=3A0155B37D8FF829&journal_id=1002-137X&journal_name=计算机科学&referenced_num=3&reference_num=10