4117 search results - page 239 / 824 » On the Satisfiability of Complex Constraints |
186
click to vote
AGP
1998
IEEE
15 years 11 months ago
1998
IEEE
Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of ...
156
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
202
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
255
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
168
click to vote
TCS
2008
15 years 6 months ago
2008
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...