933 search results - page 24 / 187 » Extending Forward Checking |
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
PLDI
1998
ACM
14 years 21 days ago
1998
ACM
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
ATAL
2004
Springer
14 years 6 days ago
2004
Springer
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
CUZA
2004
13 years 8 months ago
2004
We present several significant improvements in the implementation of the quick check pre-unification filter [7] [10], and the potential way in which the design of the quick check [...