65 search results - page 6 / 13 » GSAT and Dynamic Backtracking |
AAAI
1994
13 years 10 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
APN
2003
Springer
14 years 1 months ago
2003
Springer
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
IEAAIE
2001
Springer
14 years 1 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
DLS
2010
13 years 6 months ago
2010
The design of the Icon programming language's expression evaluation system, which can perform limited backtracking, was unique amongst imperative programming languages when c...
ATVA
2008
Springer
13 years 10 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...