메뉴 건너뛰기




Volumn 7, Issue 4, 1997, Pages 429-456

A normal form for temporal logics and its applications in theorem-proving and execution

Author keywords

Executable logics; Normal forms; Temporal logics; Theorem proving

Indexed keywords


EID: 0001765029     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.4.429     Document Type: Article
Times cited : (80)

References (35)
  • 2
    • 0025419613 scopus 로고
    • Nonclausal deduction in first-order temporal logic
    • M. Abadi and Z. Manna. Nonclausal deduction in first-order temporal logic. ACM Journal, 37, 279-317, 1990.
    • (1990) ACM Journal , vol.37 , pp. 279-317
    • Abadi, M.1    Manna, Z.2
  • 3
    • 84955604920 scopus 로고
    • Temporal logic with fixed points
    • Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, UK, B. Banieqbal, H. Barringer and A. Pnueli, eds. Springer Verlag
    • B. Banieqbal and H. Barringer. Temporal logic with fixed points. In Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, UK, B. Banieqbal, H. Barringer and A. Pnueli, eds. pp. 62-74, Vol. 398 of Lecture Notes in Computer Science, Springer Verlag, 1987.
    • (1987) Lecture Notes in Computer Science , vol.398 , pp. 62-74
    • Banieqbal, B.1    Barringer, H.2
  • 4
    • 85027599669 scopus 로고
    • METATEM: A framework for programming in temporal logic
    • Proceedings of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctn ess, Mook, Netherlands, June 1989 Springer Verlag
    • H. Barringer, M. Fisher, D. Gabbay, G. Cough, and R. Owens. METATEM: a framework for programming in temporal logic. In Proceedings of REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctn ess, Mook, Netherlands, June 1989. Vol. 430 of Lecture Notes in Computer Science, Springer Verlag, 1989.
    • (1989) Lecture Notes in Computer Science , vol.430
    • Barringer, H.1    Fisher, M.2    Gabbay, D.3    Cough, G.4    Owens, R.5
  • 7
    • 84972526396 scopus 로고
    • Axioms for tense logic; 1 - 'Since' and 'Until'
    • J. Burgess. Axioms for tense logic; 1 - 'Since' and 'Until'. Notre Dame Journal of Formal Logic, 23, 367-374, 1982.
    • (1982) Notre Dame Journal of Formal Logic , vol.23 , pp. 367-374
    • Burgess, J.1
  • 8
    • 84976651772 scopus 로고
    • A decision method for linear temporal logic
    • Proceedings of the 7th International Conference on Automated Deduction, R. E. Shostak, ed. Springer Verlag
    • A. Cavali and L. Fariñas del Cerro. A decision method for linear temporal logic. In Proceedings of the 7th International Conference on Automated Deduction, R. E. Shostak, ed. pp. 113-127, Vol. 170 of Lecture Notes in Computer Science, Springer Verlag, 1984.
    • (1984) Lecture Notes in Computer Science , vol.170 , pp. 113-127
    • Cavali, A.1    Fariñas Del Cerro, L.2
  • 9
    • 9444230039 scopus 로고
    • The use of renaming to improve the efficiency of clausal theorem proving
    • Ph. Jorrand and V. Sgurev, eds. Elsevier Science Publishers B.V., North-Holland
    • T. Boy de-la Tour and G. Chaminade. The use of renaming to improve the efficiency of clausal theorem proving. In Artificial Intelligence IV: Methodology. Systems, Applications, Ph. Jorrand and V. Sgurev, eds. pp. 3-12. Elsevier Science Publishers B.V., North-Holland, 1990.
    • (1990) Artificial Intelligence IV: Methodology. Systems, Applications , pp. 3-12
    • Boy De-la Tour, T.1    Chaminade, G.2
  • 10
  • 11
    • 0001449325 scopus 로고
    • Temporal and modal logic
    • J. van Leeuwen, ed. Elsevier
    • E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, ed. pp. 996-1072. Elsevier, 1990.
    • (1990) Handbook of Theoretical Computer Science , pp. 996-1072
    • Emerson, E.A.1
  • 15
    • 77956810885 scopus 로고
    • A survey of concurrent METATEM - The language and its applications
    • First International Conference on Temporal Logic (ICTL), Bonn, Germany, July 1994. Springer Verlag
    • M. Fisher. A survey of concurrent METATEM - the language and its applications. In First International Conference on Temporal Logic (ICTL), Bonn, Germany, July 1994. Vol. 827 of Lecture Notes in Computer Science, Springer Verlag, 1994.
    • (1994) Lecture Notes in Computer Science , vol.827
    • Fisher, M.1
  • 16
    • 9744264600 scopus 로고
    • Transformation and synthesis in METATEM - Part I: Prepositional METATEM
    • Department of Computer Science, University of Manchester, Manchester, February
    • M. Fisher and P. Noël. Transformation and synthesis in METATEM - part I: prepositional METATEM. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Manchester, February 1992.
    • (1992) Technical Report UMCS-92-2-1
    • Fisher, M.1    Noël, P.2
  • 17
    • 85020804125 scopus 로고
    • From the past to the future: Executing temporal logic programs
    • Proceedings of Logic Programming and Automated Reasoning (LPAR), St Petersberg, Russia, July 1992. Springer Verlag
    • M. Fisher and R. Owens. From the past to the future: executing temporal logic programs. In Proceedings of Logic Programming and Automated Reasoning (LPAR), St Petersberg, Russia, July 1992. Vol. 624 of Lecture Notes in Computer Science, Springer Verlag, 1992.
    • (1992) Lecture Notes in Computer Science , vol.624
    • Fisher, M.1    Owens, R.2
  • 19
    • 84957630701 scopus 로고
    • A normal form for first-order temporal formulae
    • Proceedings of Eleventh International Conference on Automated Deduction (CADE), Saratoga Springs, New York, June 1992 Springer Verlag
    • M. Fisher. A normal form for first-order temporal formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE), Saratoga Springs, New York, June 1992. Vol. 607 of Lecture Notes in Computer Science, Springer Verlag, 1992.
    • (1992) Lecture Notes in Computer Science , vol.607
    • Fisher, M.1
  • 20
    • 33646558732 scopus 로고
    • Concurrent METATEM - A language for modeling reactive systems
    • Parallel Architectures and Languages, Europe (PARLE), Munich, Germany. Springer Verlag
    • M. Fisher. Concurrent METATEM - a language for modeling reactive systems. In Parallel Architectures and Languages, Europe (PARLE), Munich, Germany. Vol. 694 of Lecture Notes in Computer Science, Springer Verlag, 1993.
    • (1993) Lecture Notes in Computer Science , vol.694
    • Fisher, M.1
  • 21
    • 0030100531 scopus 로고    scopus 로고
    • An introduction to executable temporal logics
    • M. Fisher. An introduction to executable temporal logics. Knowledge Engineering Review, 11, 43-56, 1996.
    • (1996) Knowledge Engineering Review , vol.11 , pp. 43-56
    • Fisher, M.1
  • 23
    • 0001659334 scopus 로고
    • Declarative past and imperative future: Executable temporal logic for interactive systems
    • Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, UK, 1987. B. Banieqbal, H. Barringer and A. Pnueli, eds. Springer Verlag
    • D. Gabbay. Declarative past and imperative future: executable temporal logic for interactive systems. In Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, UK, 1987. B. Banieqbal, H. Barringer and A. Pnueli, eds. pp. 402-450. Vol. 398 of Lecture Notes in Computer Science, Springer Verlag, 1987.
    • (1987) Lecture Notes in Computer Science , vol.398 , pp. 402-450
    • Gabbay, D.1
  • 28
    • 33746222270 scopus 로고
    • Gentzen-type systems and resolution rules, part I: Prepositional logic
    • Springer Verlag
    • G. Mints. Gentzen-type systems and resolution rules, part I: prepositional logic. Vol. 417 of Lecture Notes in Computer Science, pp. 198-231, Springer Verlag, 1990.
    • (1990) Lecture Notes in Computer Science , vol.417 , pp. 198-231
    • Mints, G.1
  • 30
    • 84918983692 scopus 로고
    • A machine based logic based on the resolution principle
    • J. A. Robinson. A machine based logic based on the resolution principle. ACM Journal, 12, 23-41, 1965.
    • (1965) ACM Journal , vol.12 , pp. 23-41
    • Robinson, J.A.1
  • 31
    • 0022704337 scopus 로고
    • Automata-theoretic techniques for modal logics of programs
    • M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32, 183-219, 1986.
    • (1986) Journal of Computer and System Sciences , vol.32 , pp. 183-219
    • Vardi, M.Y.1    Wolper, P.2
  • 32
    • 85034811871 scopus 로고
    • A decision method for temporal logic based on resolution
    • Springer Verlag
    • G. Venkatesh. A decision method for temporal logic based on resolution. Vol. 206 of Lecture Notes in Computer Science, pp. 272-289, Springer Verlag, 1986.
    • (1986) Lecture Notes in Computer Science , vol.206 , pp. 272-289
    • Venkatesh, G.1
  • 34
    • 0000427127 scopus 로고
    • The tableau method for temporal logic: An overview
    • P. Wolper. The tableau method for temporal logic: an overview. Logique et Analyse, 110-111, 119-136, 1985.
    • (1985) Logique et Analyse , vol.110-111 , pp. 119-136
    • Wolper, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.