Skip to main content
SpringerLink
Log in

A clausal resolution method for branching-time logic ECTL+

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

We expand the applicability of the clausal resolution technique to the branching-time temporal logic ECTL+. ECTL+ is strictly more expressive than the basic computation tree logic CTL and its extension, ECTL, as it allows Boolean combinations of fairness and single temporal operators. We show how any ECTL+ formula can be translated to a normal form the structure of which was initially defined for CTL and then used for ECTL. This enables us to apply to ECTL+ a resolution technique defined over the set of clauses. Both correctness of the method and complexity of the transformation procedure are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Bachmair and H. Ganzinger, A theory of resolution, in: Handbook of Automated Reasoning, eds. J.A. Robinson and A. Voronkov, chapter 2 (Elsevier, 2001).

  2. A. Bolotov, Clausal Resolution for Branching-Time Temporal Logic, PhD thesis, Department of Computing and Mathematics, The Manchester Metropolitan University, 2000.

  3. A. Bolotov, Clausal resolution for extended computation tree logic ECTL, in: Proceedings of the Time – 2003/International Conference on Temporal Logic 2003 (Cairns, IEEE, July 2003).

  4. A. Bolotov and A. Basukoski, Clausal resolution for extended computation tree logic ECTL, Journal of Applied Logic (In Press).

  5. A. Bolotov and C. Dixon, Resolution for branching time temporal logics: Applying the temporal resolution rule, in: Proceedings of the 7th International Conference on Temporal Representation and Reasoning (TIME2000) pp. 163–172, Cape Breton, Nova Scotia, Canada, 2000. IEEE Computer Society.

  6. A. Bolotov and M. Fisher, A clausal resolution method for CTL branching time temporal logic, Journal of Experimental and Theoretical Artificial Intelligence 11 (1999) 77–93.

    Article  MATH  Google Scholar 

  7. J. Bradfield and C. Stirling, Modal logics and mu-calculi, in: Handbook of Process Algebra, eds. J. Bergstra, A. Ponse and S. Smolka (Elsevier, North-Holland, 2001) pp. 293–330.

    Chapter  Google Scholar 

  8. E.A. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science: Volume B, Formal Models and Semantics, eds. J. van Leeuwen (Elsevier, 1990) pp. 996–1072.

  9. E.A. Emerson, Automated reasoning about reactive systems, in: Logics for Concurrency: Structures Versus Automata, Proc. of International Workshop, vol. 1043 of Lecture Notes in Computer Science (Springer, 1996) pp. 41–101.

  10. E.A. Emerson and J.Y. Halpern, Decision procedures and expressiveness in the temporal logic of branching time JCSS 30(1) (1985) 1–24.

    MATH  MathSciNet  Google Scholar 

  11. E.A. Emerson and J.Y. Halpern, “Sometimes” and “Not never” revisited: On branching versus linear time temporal logic, JACM 33(1) (1986) 151–178.

    Article  MATH  MathSciNet  Google Scholar 

  12. E.A. Emerson and A.P. Sistla, Deciding full branching time logic, in: STOC 1984, Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp. 14–24, 1984.

  13. M. Fisher, A resolution method for temporal logic, in: Proc. of the XII International Joint Conference on Artificial Intelligence (IJCAI) (1991) pp. 99–104.

  14. M. Fisher, C. Dixon and M. Peim, Clausal temporal resolution, ACM Transactions on Computational Logic (TOCL) 1(2) (2001) 12–56.

    Article  MathSciNet  Google Scholar 

  15. T. Hafer and W. Thomas, Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree, in: Automata, Languages and Programming, Proc. 14 ICALP, vol. 267 of Lecture Notes in Computer Science (1987) pp. 269–279.

  16. P. Wolper, On the relation of programs and computations to models of temporal logic, in: Time and Logic, a computational approach, eds. L. Bolc and A. Szałas, chapter 3 (UCL, 1995) pp. 131–178.

Download references

Author information

Authors and Affiliations

  1. Harrow School of Computer Science, University of Westminster, Watford Road, HA1 3TP, UK

    Alexander Bolotov & Artie Basukoski

Authors
  1. Alexander Bolotov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Artie Basukoski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Bolotov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bolotov, A., Basukoski, A. A clausal resolution method for branching-time logic ECTL+ . Ann Math Artif Intell 46, 235–263 (2006). https://doi.org/10.1007/s10472-006-9018-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-006-9018-1

Keywords

AMS subject classification

Search

Navigation