| 基于多Agent的可满足性问题求解系统研究 |
| |
| 引用本文： | 孙宁,薛亮.基于多Agent的可满足性问题求解系统研究[J].计算机工程与设计,2010,31(3). |
| |
| 作者姓名： | 孙宁 薛亮 |
| |
| 作者单位： | 中国人民解放军92232部队,北京,100161 |
| |
| 摘 要： | 为了得到高效可扩展的可满足性问题求解方法,融合目前解决可满足性问题(SAT)的诸多最新策略:快速DPLL、启发式极性决策算法等,提出了一种基于多Agent(Multi-Agent)的可满足性问题(SAT)验证方法.该方法给出了基于多Agent的可满足性问题求解系统的总体结构、工作流程和消息协议,详细分析了有关Agent的结构原理,在JADF(Java Agent development framework)基础上设计出智能仿真模型,通过实例研究表明该方法比传统的一般性求解方法精度高、速度快,且有较好的扩展性和可移植性.
|
| 关 键 词： | 多智能体 可满足性问题 完全算法 局部搜索算法 合取范式 |
Study of SAT-solver system based on multi-Agent |
| |
| SUN Ning,XUE Liang.Study of SAT-solver system based on multi-Agent[J].Computer Engineering and Design,2010,31(3). |
| |
| Authors: | SUN Ning XUE Liang |
| |
| Affiliation: | SUN Ning,XUE Liang (92232 Unit of PLA,Beijing 100161,China) |
| |
| Abstract: | In order to solve the SAT problem more efficiently,based on the multi-agent theory,a new scalable method is presented by integrating such latest,mature and reliable strategies as fast DPLL into one community.The higher hierarchy structure,working procedure of the system and message communication protocol are given,and further more,the agent theory is analyzed in detail.Based on Java agent development framework,an intelligent simulation platform is studied and designed.Experiments indicate that this system w... |
| |
| Keywords: | multi-Agent satisfiability complete algorithm local search algorithm CNF |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
