AAAI
2000
13 years 6 months ago
2000
We present a general algorithm for synthesizing state invariants that speed up automated planners and have other applications in reasoning about change. Invariants are facts that ...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
KR
2004
Springer
13 years 10 months ago
2004
Springer
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...