finding relations among linear constraints

	finding relations among linear constraints
	Yan Jun; Zhang Jian; Xu Zhongxing
	2006
会议名称	8th International Conference on Artificial Intelligence and Symbolic Computation
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	226-240
会议日期	SEP 20-22,
会议地点	Beijing, PEOPLES R CHINA
收录类别	SCI ; EI
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-39728-0
部门归属	Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China. Grad Univ, Chinese Acad Sci, Beijing, Peoples R China.
摘要	In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among these constraints first. This paper studies the problem of finding
关键词	Boolean Algebra Heuristic Methods Linear Systems Numerical Methods Polynomials Problem Solving
WOS记录号	WOS:000242127700018
引用统计	被引频次：3[WOS] [WOS记录] [WOS相关记录]
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12128
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Yan Jun,Zhang Jian,Xu Zhongxing. finding relations among linear constraints[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS,2006:226-240.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
finding relations am（451KB）			开放获取	--	请求全文