Clausal reasoning for branching-time logics

@inproceedings{Zhang2010ClausalRF,
  title={Clausal reasoning for branching-time logics},
  author={Lan 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 CTL for CTL. The calculus requires a polynomial… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…