10871 search results - page 1874 / 2175 » A stable programming language |
190
click to vote
CAV
2003
Springer
15 years 12 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
159
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
169
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
144
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
158
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...