Clausal reasoning for branching-time logics

@inproceedings{Zhang2010ClausalRF,
  title={Clausal reasoning for branching-time logics},
  author={L. C. Zhang},
  year={2010}
}
Computation Tree Logic (CTL) is a branching-time temporal logic whose underlying model of time is a choice of possibilities branching into the future. It has been used in a wide variety of areas in Computer Science and Artificial Intelligence, such as temporal databases, hardware verification, program reasoning, multi-agent systems, and concurrent and distributed systems. In this thesis, firstly we present a refined clausal resolution calculus R�,S CTL for CTL. The calculus requires a… CONTINUE READING

Citations

Publications citing this paper.

References

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

Clausal temporal resolution

  • ACM Trans. Comput. Log.
  • 2001
VIEW 18 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 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…