A resolution calculus for the branching-time temporal logic CTL

@article{Zhang2014ARC,
  title={A resolution calculus for the branching-time temporal logic CTL},
  author={L. C. Zhang and Ullrich Hustadt and Clare Dixon},
  journal={ACM Trans. Comput. Log.},
  year={2014},
  volume={15},
  pages={10:1-10:38}
}
The branching-time temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. We use indices in the normal form to represent particular paths and the application of the resolution rules is restricted dependent on an ordering and selection function to reduce the search space… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Using BDDs to Decide CTL

  • TACAS
  • 2005
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Resolution Theorem Proving

  • Handbook of Automated Reasoning
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Resolution for branching time temporal logics: applying the temporal resolution rule

  • Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000
  • 2000
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Clausal temporal resolution

  • ACM Trans. Comput. Log.
  • 1999
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Temporal and Modal Logic

  • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL