# Clausal reasoning for branching-time logics

@inproceedings{Zhang2010ClausalRF, title={Clausal reasoning for branching-time logics}, author={L. C. Zhang}, year={2010} }

- Published 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.

SHOWING 1-3 OF 3 CITATIONS

## A resolution-based calculus for Coalition Logic

VIEW 6 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A resolution calculus for the branching-time temporal logic CTL

VIEW 3 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 71 REFERENCES

## System Description : The Tableaux Work Bench

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## TRP + + : A temporal resolution prover ?

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Clausal temporal resolution

VIEW 18 EXCERPTS

HIGHLY INFLUENTIAL

## Propositional Logic: Deduction and Algorithms

VIEW 17 EXCERPTS

HIGHLY INFLUENTIAL

## Tableau-based decision procedures for logics of strategic ability in multiagent systems

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## System Description: SpassVersion 3.0

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Clausal resolution in a logic of rational agency

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Resolution Theorem Proving

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Clausal resolution for branching-time temporal logic

VIEW 12 EXCERPTS

HIGHLY INFLUENTIAL

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

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL