Title: | finding relations among linear constraints |
Author: | Yan Jun
; Zhang Jian
; Xu Zhongxing
|
Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
Conference Name: | 8th International Conference on Artificial Intelligence and Symbolic Computation
|
Conference Date: | SEP 20-22,
|
Issued Date: | 2006
|
Conference Place: | Beijing, PEOPLES R CHINA
|
Keyword: | Boolean algebra
; Heuristic methods
; Linear systems
; Numerical methods
; Polynomials
; Problem solving
|
Publisher: | ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS
|
Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
Indexed Type: | SCI
; EI
|
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 |
Citation statistics: |
|
Content Type: | 会议论文
|
URI: | http://ir.iscas.ac.cn/handle/311060/12128
|
Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
File Name/ File Size |
Content Type |
Version |
Access |
License |
|
finding relations among linear constraints.pdf(451KB) | -- | -- | 限制开放 | -- | 联系获取全文 |
|
Recommended Citation: |
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,.
|
|
|