中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Polynomial algorithm of limited propositional deduction

文献类型:期刊论文

作者Shi, ZZ; Liao, LJ
刊名SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES
出版日期1999-08-01
卷号42期号:4页码:418-424
关键词limited propositional deduction polynomial algorithm problem of propositional satisfiability constraint satisfaction problem
ISSN号1006-9321
英文摘要For the problem of propositional satisfiability a polynomial algorithm of limited propositional deduction is proposed which can be viewed as a sort of boolean constraint propagation mechanism. It can be embodied in a backtracking search program for propositional satisfiability problems to make search efficient. The efficiency is gained in two ways: One is to use the algorithm to derive literals so as to overcome the ambiguities in search. The other is to exploit the consequence sets of unbound atoms generated during limited deduction as a heuristic measure for possible choices. The experiments have shown remarkable improvement in reducing search space.
WOS研究方向Engineering ; Materials Science
语种英语
WOS记录号WOS:000082228000010
出版者SCIENCE PRESS
源URL[http://119.78.100.204/handle/2XEOYT63/13279]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Shi, ZZ
作者单位Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Shi, ZZ,Liao, LJ. Polynomial algorithm of limited propositional deduction[J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES,1999,42(4):418-424.
APA Shi, ZZ,&Liao, LJ.(1999).Polynomial algorithm of limited propositional deduction.SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES,42(4),418-424.
MLA Shi, ZZ,et al."Polynomial algorithm of limited propositional deduction".SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES 42.4(1999):418-424.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。