AAAI
2000
15 years 29 days 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 ...
86
Voted
CONCUR
2008
Springer
15 years 1 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
15 years 5 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...