finding relations among linear constraints
文献类型：会议论文
| 作者 | Yan Jun ; Zhang Jian ; Xu Zhongxing |
| 出版日期 | 2006 |
| 会议名称 | 8th International Conference on Artificial Intelligence and Symbolic Computation |
| 会议日期 | SEP 20-22, |
| 会议地点 | Beijing, PEOPLES R CHINA |
| 关键词 | Boolean algebra Heuristic methods Linear systems Numerical methods Polynomials Problem solving |
| 页码 | 226-240 |
| 英文摘要 | 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 |
| 收录类别 | SCI ; EI |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| ISSN号 | 0302-9743 |
| ISBN号 | 3-540-39728-0 |
| WOS记录号 | WOS:000242127700018 |
| 源URL | [http://124.16.136.157/handle/311060/12128]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Yan Jun,Zhang Jian,Xu Zhongxing. finding relations among linear constraints[C]. 见:8th International Conference on Artificial Intelligence and Symbolic Computation. Beijing, PEOPLES R CHINA. SEP 20-22,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。