Temporal resolution using a breadth-first search
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.08 |
We extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are computation tree logic (CTL), often regarded as the simplest useful logic of this class, and extended ...