209 search results - page 11 / 42 » Decomposable Constraints |
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— In bounded model checking (BMC)-based verification flows lack of reachability constraints often leads to false negatives. At present, it is daily practice of a veri...
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
AAAI
1998
13 years 8 months ago
1998
The problem of recognizing mathematical expressions differs significantly from the recognition of standard prose. While in prose significant constraints can be put on the interpre...
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CAD
2010
Springer
13 years 7 months ago
2010
Springer
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...