| 一阶逻辑中约束求解的局部搜索法* |
| |
| 引用本文： | 张,健.一阶逻辑中约束求解的局部搜索法*[J].软件学报,1998,9(8):598-600. |
| |
| 作者姓名： | 张 健 |
| |
| 作者单位： | 中国科学院软件研究所计算机科学实验室,北京,100080 |
| |
| 基金项目： | 本文研究得到国家863高科技项目基金和中国科学院择优支持回国工作基金资助. |
| |
| 摘 要： | 以一阶谓词逻辑为基础,讨论约束满足问题.着重研究一阶逻辑公式可满足性的局部搜索法,并与命题逻辑中的可满足性过程加以比较.以皇后问题和哈密顿回路问题为例,说明基于一阶逻辑的方法能处理较大的问题实例.
|
| 关 键 词： | 约束满足问题 一阶谓词逻辑 局部搜索. |
| 收稿时间： | 1997/3/31 0:00:00 |
| 修稿时间： | 1997/7/30 0:00:00 |
Local Search Methods for Constraint Solving in First-Order Logic |
| |
| ZHANG Jian.Local Search Methods for Constraint Solving in First-Order Logic[J].Journal of Software,1998,9(8):598-600. |
| |
| Authors: | ZHANG Jian |
| |
| Affiliation: | Laboratory of Computer Science\ Institute of Software\ The Chinese Academy of Sciences\ Beijing\ 100080 |
| |
| Abstract: | In this paper, the author discusses constraint satisfaction problems in the framework of first-order logic. Local search methods for satisfying first-order formulas are studied, and compared with satisfiability procedures in the propositional logic. Experimental results on the Queens problem and the Hamiltanian circuit problem show that the framework is suitable for dealing with quite large problem instances. |
| |
| Keywords: | Constraint satisfaction problems first-order predicate logic local search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
