Institutional Repository
| finding relations among linear constraints | |
| Yan Jun; Zhang Jian; Xu Zhongxing | |
| 2006 | |
| Conference Name | 8th International Conference on Artificial Intelligence and Symbolic Computation |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 226-240 |
| Conference Date | SEP 20-22, |
| Conference Place | Beijing, PEOPLES R CHINA |
| Indexed Type | SCI ; EI |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 3-540-39728-0 |
| Department | Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China. Grad Univ, Chinese Acad Sci, Beijing, Peoples R China. |
| English Abstract | 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 |
| Keyword | Boolean Algebra Heuristic Methods Linear Systems Numerical Methods Polynomials Problem Solving |
| WOS ID | WOS:000242127700018 |
| Citation statistics | |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12128 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| finding relations am（451KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment